Minimal bricks

DOI10.1016/j.jctb.2005.10.005zbMath1092.05056arXiv1907.00305OpenAlexW3101938886MaRDI QIDQ2496202

Robin Thomas, Serguei Norine

Publication date: 12 July 2006

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

Full work available at URL: https://arxiv.org/abs/1907.00305

zbMATH Keywords

graphperfect matching

Mathematics Subject Classification ID

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

Related Items

Bicritical graphs without removable edges, Minimal braces, Minimally \(k\)-factor-critical graphs for some large \(k\), The cubic vertices of solid minimal bricks, Minimum degree of minimal \((n-10)\)-factor-critical graphs, Minimal bricks have many vertices of small degree, The Cubic Vertices of Minimal Bricks

Cites Work

• Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
• Ear-decompositions of matching-covered graphs
• Brick decompositions and the matching rank of graphs
• Matching theory
• Matching structure and the matching lattice
• How to build a brick
• Generating bricks