| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652021 | Electronic Notes in Discrete Mathematics | 2013 | 6 Pages |
Abstract
Bricks are 3-connected bicritical graphs. Together with braces, they arise in matching theory as building blocks for matching covered graphs.We prove that every minimal brick on n vertices has at least vertices of degree at most 4. This proves a relaxed version of a conjecture of Norine and Thomas, which suggests that every minimal brick has some fixed positive fraction of vertices of degree 3.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
