Generating bricks

DOI10.1016/j.jctb.2007.01.002zbMath1123.05077OpenAlexW2911804697MaRDI QIDQ2642014

Serguei Norine, Robin Thomas

Publication date: 20 August 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2007.01.002

zbMATH Keywords

graphperfect matchingsplitter theoremgenerating theorembrick

Mathematics Subject Classification ID

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

Related Items (15)

On Two Unsolved Problems Concerning Matching Covered Graphs ⋮ Thin edges in braces ⋮ A generalization of Little's theorem on Pfaffian orientations ⋮ Minimal braces ⋮ Generating simple near‐bipartite bricks ⋮ Excluding a planar matching minor in bipartite graphs ⋮ Minimal bricks have many vertices of small degree ⋮ Birkhoff--von Neumann Graphs that are PM-Compact ⋮ Minimally non-Pfaffian graphs ⋮ Pfaffian labelings and signs of edge colorings ⋮ Matching extension in prism graphs ⋮ The Cubic Vertices of Minimal Bricks ⋮ Minimal bricks ⋮ K ₄ -free and C6¯-free Planar Matching Covered Graphs ⋮ \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
• Brick decompositions and the matching rank of graphs
• Matching theory
• Matching structure and the matching lattice
• Decomposition of regular matroids
• Pólya's permanent problem
• Permanents, Pfaffian orientations, and even directed circuits
• How to build a brick
• Brace generation
• Maximum matching and a polyhedron with 0,1-vertices
• Graph Drawing

This page was built for publication: Generating bricks