The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices
scientific article; zbMATH DE number 6510930