Abstract
This paper proves that for each positive integer m, there is a triangle free planar graph G which is not (3m+⌈m17⌉−1,m)-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
