Options
On the Chromatic Number of (P<inf>6</inf> , Diamond)-Free Graphs
Date Issued
01-07-2018
Author(s)
Karthick, T.
Mishra, Suchismita
Abstract
In this paper, we first show that every (P6, diamond, K4)-free graph is 6-colorable. We also give an example of a (P6, diamond, K4)-free graph G with χ(G) = 6. Further, we show that for every (P6, diamond)-free graph G, the chromatic number of G is upper bounded by a linear function of its clique number. This generalizes some known results in the literature.
Volume
34