On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic

DOI10.1006/JCTB.2001.2092zbMATH Open1024.05070OpenAlexW1567232491MaRDI QIDQ1850604FDOQ1850604

Marcelo H. de Carvalho, Cláudio L. 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.2092

Mathematics Subject Classification ID

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

Cites Work

• Matching theory
• Ear decompositions of matching covered graphs
• On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph

Cited In (16)

• Nice pairs of odd cycles in fullerene graphs
• On essentially 4-edge-connected cubic bricks
• The perfect matching polytope and solid bricks
• On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
• Optimal ear decompositions of matching covered graphs and bases for the matching lattice
• How to build a brick
• On Two Unsolved Problems Concerning Matching Covered Graphs
• A generalization of Little's theorem on Pfaffian orientations
• Thin edges in braces
• Laminar tight cuts in matching covered graphs
• A characterization of minimal non-Seymour graphs
• Removable Edges in Claw-Free Bricks
• \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks
• A note on tight cuts in matching-covered graphs
• Pfaffian labelings and signs of edge colorings
• On the number of dissimilar pfaffian orientations of graphs

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)