Coloring ($P_6$, diamond, $K_4$)-free graphs

We show that every ($P_6$, diamond, $K_4$)-free graph is $6$-colorable. Moreover, we give an example of a ($P_6$, diamond, $K_4$)-free graph $G$ with $\chi(G) = 6$. This generalizes some known results in the literature.

[1]  Sylvain Gravier,et al.  Coloring the hypergraph of maximal cliques of a graph with no long path , 2003, Discret. Math..

[2]  Alan Tucker.  Coloring perfect (K4 - e)-free graphs , 1987, J. Comb. Theory, Ser. B.

[3]  Kristina Vuskovic,et al.  Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences , 2009, J. Comb. Theory, Ser. B.

[4]  Daniël Paulusma,et al.  Colouring diamond-free graphs , 2015, J. Comput. Syst. Sci..

[5]  T. Karthick,et al.  Maximal cliques in {P2 UNION P3, C4}-free graphs , 2010, Discret. Math..

[6]  Louis Esperet,et al.  The chromatic number of {P5, K4}-free graphs , 2013, Discret. Math..

[7]  Sheshayya A. Choudum,et al.  Colouring of $$(P_3 \cup P_2)$$(P3∪P2)-free graphs , 2016, Graphs Comb..

[8]  Frédéric Maffray,et al.  Vizing Bound for the Chromatic Number on Some Graph Classes , 2016, Graphs Comb..

[9]  Bruce A. Reed,et al.  Bisimplicial vertices in even-hole-free graphs , 2008, J. Comb. Theory, Ser. B.

[10]  P. Seymour,et al.  The Strong Perfect Graph Theorem , 2002, math/0212070.

[11]  Artem V. Pyatkin.  Triangle-free 2P3-free graphs are 4-colorable , 2013, Discret. Math..

[12]  Ingo Schiermeyer,et al.  Vertex Colouring and Forbidden Subgraphs – A Survey , 2004, Graphs Comb..

[13]  Jan Mycielski.  Sur le coloriage des graphs , 1955 .

[14]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[15]  Robin Thomas,et al.  K4-free graphs with no odd holes , 2010, J. Comb. Theory, Ser. B.

[16]  Raffaele Mosca,et al.  Independent sets in (P6, diamond)-free graphs , 2009, Discret. Math. Theor. Comput. Sci..

[17]  Ingo Schiermeyer,et al.  Three-colourability and forbidden subgraphs. II: polynomial algorithms , 2002, Discret. Math..

[18]  Baogang Xu,et al.  Forbidden Subgraphs and 3-Colorings , 2014, SIAM J. Discret. Math..

[19]  D. West.  Introduction to Graph Theory , 1995 .

[20]  Vassilis Giakoumakis,et al.  Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences , 2011, Discret. Appl. Math..