Year: 2017
Type: preprint
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 $χ(G) = 6$. This generalizes some known results in the literature.
Source: arXiv (Cornell University)
Authors: Karthick, T., Mishra, Suchismita
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2593878254