Optimal ear decompositions of matching covered graphs and bases for the matching lattice

DOI10.1006/jctb.2001.2090zbMath1024.05071OpenAlexW1964864950MaRDI QIDQ1850602

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

Publication date: 10 December 2002

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

Full work available at URL: https://semanticscholar.org/paper/bebd9f5240450a31cdaed7c75fde6e75c8723854

zbMATH Keywords

perfect matchingear decompositionPetersen graphbrickmatching covered graphbicritical graphmatching lattice

Mathematics Subject Classification ID

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

Related Items

Nice pairs of odd cycles in fullerene graphs, A generalization of Little's theorem on Pfaffian orientations, Even cycles and perfect matchings in claw-free plane graphs, Ear decomposition and induced even cycles, A characterization of nonfeasible sets in matching covered graphs, Generating simple near‐bipartite bricks, Some snarks are worse than others, How to build a brick, On the number of dissimilar pfaffian orientations of graphs, On essentially 4-edge-connected cubic bricks, \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks, Faces of Birkhoff Polytopes, Cycle bases for lattices of binary matroids with no Fano dual minor and their one-element extensions, On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph

Cites Work

• Unnamed Item
• Brick decompositions and the matching rank of graphs
• Matching theory
• Matching structure and the matching lattice
• Ear decompositions of matching covered graphs
• The two ear theorem on matching-covered graphs
• Perfect matchings versus odd cuts
• On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
• On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic
• Rank of maximum matchings in a graph
• Ear Decompositions of Elementary Graphs and GF2-rank of Perfect Matchings
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte