Pages that link to "Item:Q344868"

The following pages link to Vertex coloring of graphs with few obstructions (Q344868):

Displaying 10 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)
• Polynomial cases for the vertex coloring problem (Q666663) (← links)
• The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
• The weighted coloring problem for two graph classes characterized by small forbidden induced structures (Q1671374) (← links)
• A coloring algorithm for \(4 K_1\)-free line graphs (Q1686052) (← links)
• On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
• Two cases of polynomial-time solvability for the coloring problem (Q5963654) (← links)