Abstract
This paper proves that if $G$ is a triangle-free planar graph in which no $4$-cycle is adjacent to a $4$-cycle or a $5$-cycle, then $G$ is on-line $3$-choosable.
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
