Independent sets in triangle-free cubic planar graphs

: 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

• Type: Journal
• Year: 2006
• Where: JCT
• Authors: Christopher Carl Heckman, Robin Thomas
• Keywords: JCT 2006, Triangle-free Planar Graph