The Cubic Vertices of Minimal Bricks
Fenggen Lin, Lianzhu Zhang, Fuliang Lu · Journal of Graph Theory · 2013
Abstract A graph is a brick if it is 3‐connected and bicritical. A brick is minimal if for every edge, the deletion of it results in a graph that is not a brick. In this article, we prove that every minimal brick has at least four cubic vertices.