Equivalence classes in matching covered graphs

DOI10.1016/j.disc.2020.111945zbMath1441.05186arXiv1902.09260OpenAlexW3022029076MaRDI QIDQ2185935

Fuliang Lu, Nishad Kothari, Xing Feng, Lian Zhu Zhang

Publication date: 8 June 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

equivalence classesperfect matchingsmatching covered graphsbrickstight cutsseparating cuts

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Matching theory
• Matching structure and the matching lattice
• Ear decompositions of matching covered graphs
• On n-extendable graphs
• On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
• On Two Unsolved Problems Concerning Matching Covered Graphs
• On perfect matchings in matching covered graphs