Abstract

Let S be an orientable surface other than the sphere and letkbe a natural number. Then there are infinitely manyk-color-critical graphs onSif and only if 3⩽k⩽5. In particular, ifk⩾5, then there exists a polynomially bounded algorithm for deciding if a graph onScan bek-colored. We extend this to the case where a subgraph of fixed cardinality is precolored. We also establish a corresponding list-color theorem.

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

Disclaimer: 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.