Perfect matchings versus odd cuts

DOI10.1007/s00493-002-0008-6zbMath1026.05090OpenAlexW2087601207MaRDI QIDQ1410409

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)

Related Items

A note on tight cuts in matching-covered graphs ⋮ How to build a brick ⋮ Disjoint Odd Cycles in Cubic Solid Bricks ⋮ Laminar tight cuts in matching covered graphs ⋮ Optimal ear decompositions of matching covered graphs and bases for the matching lattice