Pages that link to "Item:Q764301"

The following pages link to Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301):

Displaying 12 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)
• Complexity of coloring graphs without paths and cycles (Q344861) (← links)
• Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
• Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995) (← links)
• On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579) (← links)
• Coloring graphs characterized by a forbidden subgraph (Q476308) (← links)
• Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← 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)