Laminar tight cuts in matching covered graphs
From MaRDI portal
Publication:2040018
DOI10.1016/j.jctb.2021.05.003zbMath1470.90099arXiv2003.08622MaRDI QIDQ2040018
Fuliang Lu, Xing Feng, Guantao Chen, Cláudio Leonardo Lucchesi, Lian Zhu Zhang
Publication date: 6 July 2021
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.08622
90C27: Combinatorial optimization
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Brick decompositions and the matching rank of graphs
- Matching structure and the matching lattice
- 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
- The Factorization of Linear Graphs