On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic
From MaRDI portal
Publication:1850604
DOI10.1006/jctb.2001.2092zbMath1024.05070OpenAlexW1567232491MaRDI QIDQ1850604
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.2092
Related Items (15)
A note on tight cuts in matching-covered graphs ⋮ Nice pairs of odd cycles in fullerene graphs ⋮ On Two Unsolved Problems Concerning Matching Covered Graphs ⋮ Thin edges in braces ⋮ A generalization of Little's theorem on Pfaffian orientations ⋮ A characterization of minimal non-Seymour graphs ⋮ How to build a brick ⋮ Pfaffian labelings and signs of edge colorings ⋮ The perfect matching polytope and solid bricks ⋮ On the number of dissimilar pfaffian orientations of graphs ⋮ Laminar tight cuts in matching covered graphs ⋮ On essentially 4-edge-connected cubic bricks ⋮ \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks ⋮ Optimal ear decompositions of matching covered graphs and bases for the matching lattice ⋮ On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
Cites Work
This page was built for publication: On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic
