Abstract
Given two graphs H1 and H2, a graph G is (H1,H2)-free if it contains no induced subgraph isomorphic to H1 or H2. A Pt is the path on t vertices. A chair is a P4 with an additional vertex adjacent to one of the middle vertices of the P4. A graph G is k-vertex-critical if G has chromatic number k but every proper induced subgraph of G has chromatic number less than k. In this paper, we prove that there are only finitely many 5-vertex-critical (P5,chair)-free graphs.
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.
