Coloring (P₆, diamond, K₄)-free graphs
classification
🧮 math.CO
cs.DM
keywords
diamondfreegraphcolorablecoloringeveryexamplegeneralizes
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.