A Coloring Algorithm for $4K_1$-free line graphs

Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng

Let $L$ be a set of graphs. $Free$($L$) is the set of graphs that do not contain any graph in $L$ as an induced subgraph. It is known that if $L$ is a set of four-vertex graphs, th…