Connected matchings

被引：0
|
作者：
Cameron, K [1 ]
机构：
[1] Wilfrid Laurier Univ, Dept Math, Waterloo, ON N2L 3C5, Canada
来源：
COMBINATORIAL OPTIMIZATION - EUREKA, YOU SHRINK: PAPERS DEDICATED TO JACK EDMONDS | 2003年 / 2570卷
关键词：
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 条
  • [31] On distance-3 matchings and induced matchings
    Brandstaedt, Andreas
    Mosca, Raffaele
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (07) : 509 - 520
  • [32] DYNAMIC MATCHINGS AND QUASIDYNAMIC FRACTIONAL MATCHINGS .1.
    ORLIN, JB
    NETWORKS, 1983, 13 (04) : 551 - 562
  • [33] 2-Connected Factor-critical Graphs G with Exactly |E(G)| + 1 Maximum Matchings
    Ming-hua LI
    Yan LIU
    Acta Mathematicae Applicatae Sinica, 2017, 33 (04) : 1001 - 1014
  • [34] 2-Connected factor-critical graphs G with exactly |E(G)| + 1 maximum matchings
    Ming-hua Li
    Yan Liu
    Acta Mathematicae Applicatae Sinica, English Series, 2017, 33 : 1001 - 1014
  • [35] EXTREMAL PROBLEM FOR MATCHINGS AND RAINBOW MATCHINGS ON DIRECT PRODUCTS
    Wang, Jian
    You, Jie
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (03) : 2030 - 2048
  • [36] 2-Connected Factor-critical Graphs G with Exactly |E(G)|+1 Maximum Matchings
    Li, Ming-hua
    Liu, Yan
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2017, 33 (04): : 1001 - 1014
  • [37] Robust matchings
    Hassin, R
    Rubinstein, S
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2002, 15 (04) : 530 - 537
  • [38] INDUCED MATCHINGS
    CAMERON, K
    DISCRETE APPLIED MATHEMATICS, 1989, 24 (1-3) : 97 - 102
  • [39] Tree matchings
    Roberts, Alexander
    JOURNAL OF GRAPH THEORY, 2020, 95 (01) : 59 - 75
  • [40] Popular matchings
    Abraham, David J.
    Irving, Robert W.
    Kavitha, Telikepalli
    Mehlhorn, Kurt
    SIAM JOURNAL ON COMPUTING, 2007, 37 (04) : 1030 - 1045
12345