On generalizations of matching-covered graphs

DOI10.1006/EUJC.2001.0505zbMath1050.05104OpenAlexW2129779055MaRDI QIDQ5946644

Zoltán Szigeti

Publication date: 2001

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

Full work available at URL: https://doi.org/10.1006/eujc.2001.0505

zbMATH Keywords

cathedral theoremear decompositionear matroid

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Brick decompositions and the matching rank of graphs
• Matching theory
• The two ear theorem on matching-covered graphs
• On a matroid defined by ear-decompositions of graphs
• Conservative weightings and ear-decompositions of graphs
• A theorem on connected graphs in which every edge belongs to a 1-factor
• The Factorization of Linear Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On generalizations of matching-covered graphs