Pages that link to "Item:Q2352049"

The following pages link to The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (Q2352049):

Displaying 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)
• The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
• Complexity classification of the edge coloring problem for a family of graph classes (Q1675533) (← links)