Abstract
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. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Cameron, K. (2003). Connected matchings. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2570, 34–38. https://doi.org/10.1007/3-540-36478-1_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
