On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic
From MaRDI portal
Publication:1850604
Cites work
Cited in
(16)- On essentially 4-edge-connected cubic bricks
- Laminar tight cuts in matching covered graphs
- Thin edges in braces
- Nice pairs of odd cycles in fullerene graphs
- Removable Edges in Claw-Free Bricks
- A generalization of Little's theorem on Pfaffian orientations
- The perfect matching polytope and solid bricks
- How to build a brick
- A characterization of minimal non-Seymour graphs
- Optimal ear decompositions of matching covered graphs and bases for the matching lattice
- On two unsolved problems concerning matching covered graphs
- On the number of dissimilar pfaffian orientations of graphs
- On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
- Pfaffian labelings and signs of edge colorings
- A note on tight cuts in matching-covered graphs
- \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks
This page was built for publication: On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850604)