On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
From MaRDI portal
Publication:1850603
DOI10.1006/jctb.2001.2091zbMath1024.05069OpenAlexW2055499237MaRDI QIDQ1850603
U. S. R. Murty, Marcelo H. De Carvalho, Cláudio Leonardo Lucchesi
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
Related Items
Nice pairs of odd cycles in fullerene graphs, On Two Unsolved Problems Concerning Matching Covered Graphs, Bicritical graphs without removable edges, A generalization of Little's theorem on Pfaffian orientations, Equivalence classes in matching covered graphs, Generating simple near‐bipartite bricks, The cubic vertices of solid minimal bricks, How to build a brick, Birkhoff--von Neumann Graphs that are PM-Compact, The Cubic Vertices of Minimal Bricks, The perfect matching polytope and solid bricks, 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, Relations between global forcing number and maximum anti-forcing number of a graph, Colouring non-even digraphs, 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, Matching theory and Barnette's conjecture
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
