The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices
From MaRDI portal
Publication:892049
zbMath1326.05047MaRDI QIDQ892049
Publication date: 18 November 2015
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: http://semr.math.nsc.ru/v11/p811-822.pdf
Related Items
Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem, Unnamed Item, A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs, A complexity dichotomy and a new boundary class for the dominating set problem, Two complexity results for the vertex coloring problem, Critical hereditary graph classes: a survey, Complexity classification of the edge coloring problem for a family of graph classes, Classifying \(k\)-edge colouring for \(H\)-free graphs