Pages that link to "Item:Q476308"

The following pages link to Coloring graphs characterized by a forbidden subgraph (Q476308):

Displaying 10 items.

• 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)
• The weighted coloring problem for two graph classes characterized by small forbidden induced structures (Q1671374) (← links)
• The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
• An intractability result for the vertex 3-colourability problem (Q2136878) (← links)
• Regular pattern-free coloring (Q2172395) (← links)
• The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (Q2409536) (← links)
• On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size (Q4973236) (← links)
• Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
• Efficient solvability of the weighted vertex coloring problem for some hereditary class of graphs with $5$-vertex prohibitions (Q5090159) (← links)