The Cubic Vertices of Minimal Bricks

DOI10.1002/jgt.21747zbMath1294.05097OpenAlexW2144326326MaRDI QIDQ5418766

Fuliang Lu, Lian Zhu Zhang, Feng-Gen Lin

Publication date: 28 May 2014

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21747

zbMATH Keywords

thin edgecubic vertexminimal brick

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (3)

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

Cites Work

• Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
• Brick decompositions and the matching rank of graphs
• Matching structure and the matching lattice
• On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
• How to build a brick
• Minimal bricks
• Generating bricks

This page was built for publication: The Cubic Vertices of Minimal Bricks