Perfect matchings versus odd cuts

DOI10.1007/S00493-002-0008-6MaRDI QIDQ1410409zbMATH OpenOpenAlexFDO

Authors Zoltán Szigeti

Publication date 14 October 2003

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-002-0008-6

zbMATH Keywords

matchingcutcritical graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The perfect matching polytope and solid bricks
• Perfect matching and polymatroids
• On tight cuts in matching covered graphs
• On cuts and matchings in planar graphs
• Laminar tight cuts in matching covered graphs

Cited in

(14)

• scientific article; zbMATH DE number 4114689 (Why is no real title available?)
• Touching perfect matchings and halving lines
• On tight cuts in matching covered graphs
• The perfect matching polytope and solid bricks
• Optimal ear decompositions of matching covered graphs and bases for the matching lattice
• How to build a brick
• Laminar tight cuts in matching covered graphs
• On cuts and matchings in planar graphs
• Odd Minimum Cut Sets and b-Matchings Revisited
• \(\mathrm{SIG}\)-dimension conjecture proved for graphs having a perfect matching
• Disjoint odd cycles in cubic solid bricks
• A note on tight cuts in matching-covered graphs
• Basilica: new canonical decomposition in matching theory
• Structure of towers and a new proof of the tight cut lemma

This page was built for publication: Perfect matchings versus odd cuts

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