The two ear theorem on matching-covered graphs

DOI10.1006/jctb.1998.1824zbMath0904.05073OpenAlexW2136039996MaRDI QIDQ1127879

Zoltán Szigeti

Publication date: 14 December 1998

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1998.1824

zbMATH Keywords

matchingsear-decomposition

Mathematics Subject Classification ID

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

Related Items (4)

Brace generation ⋮ On generalizations of matching-covered graphs ⋮ Optimal ear decompositions of matching covered graphs and bases for the matching lattice ⋮ On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph

Cites Work

• Unnamed Item
• Unnamed Item
• Spectrum and principal functions of the non-self-adjoint Sturm-Liouville operators with a singular potential
• Matching theory
• Ear decompositions of matching covered graphs
• Perfect matchings of a graph
• On Representatives of Subsets
• On the structure of factorizable graphs
• The Factorization of Linear Graphs

This page was built for publication: The two ear theorem on matching-covered graphs