How to build a brick
From MaRDI portal
Publication:2433703
DOI10.1016/j.disc.2005.12.032zbMath1106.05075OpenAlexW2153548489MaRDI QIDQ2433703
U. S. R. Murty, Cláudio Leonardo Lucchesi, Marcelo H. De Carvalho
Publication date: 30 October 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.12.032
Related Items
Nice pairs of disjoint pentagons in fullerene graphs ⋮ Nice pairs of odd cycles in fullerene graphs ⋮ On Two Unsolved Problems Concerning Matching Covered Graphs ⋮ Generating bricks ⋮ Thin edges in braces ⋮ A generalization of Little's theorem on Pfaffian orientations ⋮ Minimally \(k\)-factor-critical graphs for some large \(k\) ⋮ A characterization of nonfeasible sets in matching covered graphs ⋮ Generating simple near‐bipartite bricks ⋮ The cubic vertices of solid minimal bricks ⋮ Minimum degree of minimal \((n-10)\)-factor-critical graphs ⋮ Minimal bricks have many vertices of small degree ⋮ Birkhoff--von Neumann Graphs that are PM-Compact ⋮ Disjoint Odd Cycles in Cubic Solid Bricks ⋮ Matching extension in prism graphs ⋮ The Cubic Vertices of Minimal Bricks ⋮ Minimal bricks ⋮ On essentially 4-edge-connected cubic bricks ⋮ K 4 -free and C6¯-free Planar Matching Covered Graphs ⋮ \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks ⋮ Relations between global forcing number and maximum anti-forcing number of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The perfect matching polytope and solid bricks
- Brick decompositions and the matching rank of graphs
- Matching theory
- Matching structure and the matching lattice
- Perfect matchings versus odd cuts
- 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
- On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic
- Brace generation
- Graphs with independent perfect matchings
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
