| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657429 | Journal of Combinatorial Theory, Series B | 2006 | 23 Pages |
Abstract
We prove that every triangle-free planar graph on n vertices with maximum degree three has an independent set with size at least . This was suggested and later conjectured by Albertson, Bollobás, and Tucker.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
