Generating bricks

DOI10.1016/J.JCTB.2007.01.002MaRDI QIDQ2642014zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Concerning bricks
• scientific article; zbMATH DE number 3907609
• How to build a brick
• Generating near‐bipartite bricks
• Tiling Bricks with Bricks
• Euler Bricks
• scientific article; zbMATH DE number 2084622
• scientific article; zbMATH DE number 1972783

Cites work

• scientific article; zbMATH DE number 3166039 (Why is no real title available?)
• scientific article; zbMATH DE number 4047093 (Why is no real title available?)
• scientific article; zbMATH DE number 13859 (Why is no real title available?)
• scientific article; zbMATH DE number 1559555 (Why is no real title available?)
• scientific article; zbMATH DE number 3326387 (Why is no real title available?)
• Brace generation
• Brick decompositions and the matching rank of graphs
• Decomposition of regular matroids
• Graph Drawing
• How to build a brick
• Matching structure and the matching lattice
• Matching theory
• Maximum matching and a polyhedron with 0,1-vertices
• Permanents, Pfaffian orientations, and even directed circuits
• Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
• Pólya's permanent problem

Cited in

(25)

• Removable edges in near-bricks
• The cubic vertices of minimal bricks
• On two unsolved problems concerning matching covered graphs
• Dissecting a brick into bars
• Minimal bricks have many vertices of small degree
• Excluding a planar matching minor in bipartite graphs
• On essentially 4-edge-connected cubic bricks
• How to build a brick
• Minimally non-Pfaffian graphs
• \(K_4\)-free and \(\overline{C_6}\)-free planar matching covered graphs
• Brick partitions of graphs
• Minimal braces
• A generalization of Little's theorem on Pfaffian orientations
• Thin edges in braces
• On extremal nonsolid bricks
• Generating simple near‐bipartite bricks
• Birkhoff-von Neumann graphs that are PM-compact
• Minimal bricks
• \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks
• Generating near‐bipartite bricks
• Disjoint odd cycles in cubic solid bricks
• Pfaffian labelings and signs of edge colorings
• Euler Bricks
• Matching extension in prism graphs
• Structure of towers and a new proof of the tight cut lemma

This page was built for publication: Generating bricks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642014)