Emergent Mind
Coloring graphs with no induced five-vertex path or gem
(1810.06186)
Published Oct 15, 2018
in
math.CO
and
cs.DM
Abstract
For a graph $G$, let $\chi(G)$ and $\omega(G)$ respectively denote the chromatic number and clique number of $G$. We give an explicit structural description of ($P_5$,gem)-free graphs, and show that every such graph $G$ satisfies $\chi(G)\le \lceil\frac{5\omega(G)}{4}\rceil$. Moreover, this bound is best possible.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.