Pages that link to "Item:Q892049"
From MaRDI portal
The following pages link to The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices (Q892049):
Displayed 6 items.
- A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs (Q260042) (← links)
- A complexity dichotomy and a new boundary class for the dominating set problem (Q328713) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- Complexity classification of the edge coloring problem for a family of graph classes (Q1675533) (← links)
- Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
