On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph

DOI10.1006/jctb.2001.2091zbMath1024.05069MaRDI QIDQ1850603

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

Publication date: 10 December 2002

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

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

zbMATH Keywords

perfect matching; Petersen graph; brick; matching covered graph; bicritical graph

Mathematics Subject Classification ID

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

Related Items

On the number of dissimilar pfaffian orientations of graphs, The perfect matching polytope and solid bricks, Optimal ear decompositions of matching covered graphs and bases for the matching lattice, On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic, A generalization of Little's theorem on Pfaffian orientations, How to build a brick

Cites Work

• Unnamed Item
• Matching theory
• Matching structure and the matching lattice
• Ear decompositions of matching covered graphs
• The two ear theorem on matching-covered graphs
• Optimal ear decompositions of matching covered graphs and bases for the matching lattice
• On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic
• Ear Decompositions of Elementary Graphs and GF2-rank of Perfect Matchings