Abstract
Abstract In this paper we study an chromatic aspect for the class of P 6 -free graphs. Here, the focus of our interest are graph classes (defined in terms of forbidden induced subgraphs) for which the question of 3-colorability can be decided in polynomial time and, if so, a proper 3-coloring can be determined also in polynomial time. Note that the 3-colorability decision problem is a well-known NP-complete problem, even for special graph classes [4]. Our approach is based on an encoding of the problem with boolean formulas making use of the existence of bounded dominating subgraphs. Together with a structural analysis of the non-perfect k 4 -free members of the graph class in consideration we obtain our main result that 3-colorability can be decided in polynomial time for the class of P 6 -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.
