The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3
As is known the problem of determining the chromatic index of a cubic graph is NP-complete. In this paper, it is shown that for a triangle free graph with maximum vertex of degree 3, to determine if its chromatic index is 3 or 4 is still NP-complete.
scientific article; zbMATH DE number 1006501