Abstract
A graph G is locally planar if it is embedded in a surface with large edge-width. Thomassen (1993) proved that every graph embedded in a fixed surface with sufficiently large edge-width is 5-colourable. DeVos et al. (2008) strengthened this result and proved that every graph embedded in a fixed surface with sufficiently large edge-width is 5-choosable. This paper further strengthens the result to on-line list colouring and proves that every graph embedded in a fixed surface with sufficiently large edge-width is 5-paintable.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
