Title of article
Independent sets in triangle-free cubic planar graphs
Author/Authors
Heckman، نويسنده , , Christopher Carl and Thomas، نويسنده , , Robin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
23
From page
253
To page
275
Abstract
We prove that every triangle-free planar graph on n vertices with maximum degree three has an independent set with size at least 3 8 n . This was suggested and later conjectured by Albertson, Bollobلs, and Tucker.
Keywords
graph , Planar graph , Independent set , Stable set , Maximum degree three , Triangle-free
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2006
Journal title
Journal of Combinatorial Theory Series B
Record number
1527661
Link To Document