Connected matchings

被引:0
|
作者
Cameron, K [1 ]
机构
[1] Wilfrid Laurier Univ, Dept Math, Waterloo, ON N2L 3C5, Canada
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A connected matching M in a graph G is a matching such that every pair of edges of M is joined by an edge of G. Plummer, Stiebitz and Toft introduced connected matchings in connection with their study of the famous Hadwiger Conjecture. In this paper, I prove that the connected matching problem is NP-complete for 0-1-weighted bipartite graphs, but polytime-solvable for chordal graphs and for graphs with no circuits of size 4.
引用
收藏
页码:34 / 38
页数:5
相关论文
共 50 条
  • [41] DEGREES AND MATCHINGS
    CHVATAL, V
    HANSON, D
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1976, 20 (02) : 128 - 138
  • [42] On matchings in groups
    Losonczy, J
    ADVANCES IN APPLIED MATHEMATICS, 1998, 20 (03) : 385 - 391
  • [43] Acyclic matchings
    Alon, N
    Fan, CK
    Kleitman, D
    Losonczy, J
    ADVANCES IN MATHEMATICS, 1996, 122 (02) : 234 - 236
  • [44] On matchings in hypergraphs
    Frankl, Peter
    Luczak, Tomasz
    Mieczkowska, Katarzyna
    ELECTRONIC JOURNAL OF COMBINATORICS, 2012, 19 (02):
  • [45] Popular Matchings
    Abraham, David J.
    Irving, Robert W.
    Kavitha, Telikepalli
    Mehlhorn, Kurt
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 424 - 432
  • [46] On matchings in graphs
    Jones, DM
    Roehm, DJ
    Schultz, M
    ARS COMBINATORIA, 1998, 50 : 65 - 79
  • [47] Flexible matchings
    Bartha, Miklos
    Kresz, Miklos
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2006, 4271 : 313 - +
  • [48] Orthogonal matchings
    Anstee, RP
    Caccetta, L
    DISCRETE MATHEMATICS, 1998, 179 (1-3) : 37 - 47
  • [49] Orthogonal matchings
    Discrete Math, 1-3 (37-47):
  • [50] SHAPES OF MATCHINGS
    STROK, M
    BULLETIN DE L ACADEMIE POLONAISE DES SCIENCES-SERIE DES SCIENCES MATHEMATIQUES ASTRONOMIQUES ET PHYSIQUES, 1976, 24 (04): : 265 - 270