Pages that link to "Item:Q1759872"

The following pages link to 4-coloring \(H\)-free graphs when \(H\) is small (Q1759872):

Displaying 18 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)
• Vertex coloring of graphs with few obstructions (Q344868) (← links)
• Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← 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)
• An intractability result for the vertex 3-colourability problem (Q2136878) (← links)
• Coloring of pseudocubic graphs in three colors (Q2287152) (← links)
• The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (Q2352049) (← links)
• The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (Q2409536) (← links)
• Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
• List coloring in the absence of two subgraphs (Q2636800) (← links)
• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
• Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem (Q5090168) (← links)