Abstract
We prove that there are 24 4-critical P6-free graphs, and give the complete list. We remark that, if H is connected and not a subgraph of P6, there are infinitely many 4-critical H-free graphs. Our result answers questions of Golovach et al. and Seymour.
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.
