Matching covered graphs with three removable classes

zbMath1300.05249MaRDI QIDQ405203

Charles H. C. Little, Marcelo H. De Carvalho

Publication date: 4 September 2014

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

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i2p13

zbMATH Keywords

perfect matchingsmatching covered graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (1)

Removable edges in Halin graphs

Cites Work

• Unnamed Item
• The perfect matching polytope and solid bricks
• Ear-decompositions of matching-covered graphs
• Matching theory
• Matching structure and the matching lattice
• Ear decompositions of matching covered graphs
• A generalization of Little's theorem on Pfaffian orientations
• Graphs with independent perfect matchings
• Circuit decompositions of join-covered graphs
• A theorem on connected graphs in which every edge belongs to a 1-factor

This page was built for publication: Matching covered graphs with three removable classes