Frédéric Maffray
Published 2017-07-27Version 1
We give a polynomial-time algorithm that computes the chromatic number of any graph that contains no path on five vertices and no bull as an induced subgraph (where the bull is the graph with five vertices $a,b,c,d,e$ and edges $ab,bc,cd,be,ce$).
Unified spectral bounds on the chromatic number
Random regular graphs of non-constant degree: Concentration of the chromatic number
About dependence of the number of edges and vertices in hypergraph clique with chromatic number 3
![QR code for arXiv:1707.08918 [math.CO]](http://oss.arxitics.com/images/favicon.svg)