Coloring (P₅, bull)-free graphs
classification
🧮 math.CO
cs.DM
keywords
bullfivegraphverticesalgorithmchromaticcoloringcomputes
read the original abstract
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$).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.