4-coloring ($P_6$, bull)-free graphs
Combinatorics
2016-02-25 v2
Abstract
We present a polynomial-time algorithm that determines whether a graph that contains no induced path on six vertices and no bull (the graph with vertices a, b, c, d, e and edges ab, bc, cd, be, ce) is 4-colorable. We also show that for any fixed k the k-coloring problem can be solved in polynomial time in the class of (, bull, gem)-free graphs.
Keywords
Cite
@article{arxiv.1511.08911,
title = {4-coloring ($P_6$, bull)-free graphs},
author = {Frédéric Maffray and Lucas Pastor},
journal= {arXiv preprint arXiv:1511.08911},
year = {2016}
}