Abstract

For a positive integer n, we use Kn and Pn to denote a complete graph and an induced path on n vertices, respectively. A subdivision of G is a graph obtained from G by replacing the edges of G with independent paths of length at least one between their end vertices. A graph is said to be ISK4-free if it does not contain any subdivision of K4 as an induced subgraph. Lévêque, Maffray and Trotignon conjectured that every ISK4-free graph is 4-colorable. In this paper, we show that this conjecture is true for the class of P6-free graphs.

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.