On tight cuts in matching covered graphs

DOI10.4310/JOC.2018.v9.n1.a8zbMath1378.05161OpenAlexW2782382376MaRDI QIDQ1691218

U. S. R. Murty, Marcelo H. De Carvalho, Cláudio Leonardo Lucchesi

Publication date: 15 January 2018

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/joc.2018.v9.n1.a8

zbMATH Keywords

perfect matchingsmatching covered graphstight cuts

Mathematics Subject Classification ID

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

Related Items (5)

A note on tight cuts in matching-covered graphs ⋮ Disjoint Odd Cycles in Cubic Solid Bricks ⋮ Laminar tight cuts in matching covered graphs ⋮ \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks ⋮ PM-compact graphs and vertex-deleted subgraphs

This page was built for publication: On tight cuts in matching covered graphs