scientific article; zbMATH DE number 1953189

MaRDI QIDQ4414635zbMATH OpenFDO

Authors Kathie Cameron

Publication date 25 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2570/25700034.htm

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial optimization (90C27)

Recommendations

• Connected matchings in chordal bipartite graphs
• Connected matchings and Hadwiger's conjecture
• The connectivity of maximum matching graphs
• Induced matchings
• On complexity of special maximum matchings constructing

Cited in

(15)

• Connected matchings in chordal bipartite graphs
• Graph matching problems and the NP-hardness of sortedness constraints
• A note on interconnecting matchings in graphs
• Acyclic matchings
• Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture
• Independent packings in structured graphs
• Connected matchings and Hadwiger's conjecture
• Multitasking capacity: hardness results and improved constructions
• Disconnected matchings
• Disconnected matchings
• Weighted connected matchings
• Polyhedral approach to weighted connected matchings in general graphs
• Complexity of deciding the equality of matching numbers
• \(\mathcal{P}\)-matchings parameterized by treewidth
• Weighted connected matchings

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414635)