2000 character limit reached
Coloring ($P_6$, diamond, $K_4$)-free graphs (1703.00606v1)
Published 2 Mar 2017 in math.CO and cs.DM
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.