The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3

摘要

We restrict the known case about the complexity of edge-coloring for cubic graphs in the case of triangle free graphs with maximum vertex degree 3.