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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
