Premium
The Cubic Vertices of Minimal Bricks
Author(s) -
Lin Fenggen,
Zhang Lianzhu,
Lu Fuliang
Publication year - 2014
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.21747
Subject(s) - brick , combinatorics , mathematics , graph , cubic graph , enhanced data rates for gsm evolution , computer science , composite material , line graph , materials science , voltage graph , telecommunications
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.