A note on tight cuts in matching-covered graphs

DOI10.46298/dmtcs.6013zbMath1498.05226arXiv2001.01190OpenAlexW3174130265MaRDI QIDQ5038195

No author found.

Publication date: 30 September 2022

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.01190

zbMATH Keywords

matching covered graphELP-cuttight cut2-separation cut

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Brick decompositions and the matching rank of graphs
• Matching structure and the matching lattice
• On n-extendable graphs
• Perfect matchings versus odd cuts
• On tight cuts in matching covered graphs
• On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic
• Laminar tight cuts in matching covered graphs

This page was built for publication: A note on tight cuts in matching-covered graphs