Generating bricks
From MaRDI portal
Publication:2642014
DOI10.1016/J.JCTB.2007.01.002zbMATH Open1123.05077OpenAlexW2911804697MaRDI QIDQ2642014FDOQ2642014
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matching theory
- Decomposition of regular matroids
- Pólya's permanent problem
- Permanents, Pfaffian orientations, and even directed circuits
- Maximum matching and a polyhedron with 0,1-vertices
- Matching structure and the matching lattice
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
- Brick decompositions and the matching rank of graphs
- Graph Drawing
- Brace generation
- How to build a brick
Cited In (19)
- Dissecting a brick into bars
- Minimal bricks have many vertices of small degree
- Excluding a planar matching minor in bipartite graphs
- Birkhoff--von Neumann Graphs that are PM-Compact
- On Two Unsolved Problems Concerning Matching Covered Graphs
- Minimally non-Pfaffian graphs
- \(K_4\)-free and \(\overline{C_6}\)-free planar matching covered graphs
- Minimal braces
- A generalization of Little's theorem on Pfaffian orientations
- On extremal nonsolid bricks
- Thin edges in braces
- Generating simple near‐bipartite bricks
- Minimal bricks
- The Cubic Vertices of Minimal Bricks
- Generating near‐bipartite bricks
- \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks
- Euler Bricks
- Pfaffian labelings and signs of edge colorings
- Matching extension in prism graphs
Recommendations
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)
