Pages that link to "Item:Q344868"

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

Displaying 35 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)
• The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
• Chromatic symmetric functions and \(H\)-free graphs (Q2000573) (← links)
• Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs (Q2124227) (← links)
• On coloring a class of claw-free graphs. (Q2132368) (← links)
• On the structure of graphs without claw, \(4K_1\) and co-R (Q2158304) (← links)
• Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter (Q2167905) (← links)
• Vertex coloring of a graph for memory constrained scenarios (Q2183733) (← links)
• The intersection of two vertex coloring problems (Q2303434) (← links)
• Colouring square-free graphs without long induced paths (Q2323345) (← links)
• The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (Q2352049) (← links)
• Polynomial-time approximation algorithms for the coloring problem in some cases (Q2359789) (← links)
• Colouring diamond-free graphs (Q2402373) (← links)
• Characterizations of \((4 K_1,C_4,C_5)\)-free graphs (Q2403803) (← links)
• The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (Q2409536) (← links)
• List coloring in the absence of two subgraphs (Q2636800) (← links)
• On the complexity of colouring antiprismatic graphs (Q2659773) (← links)
• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
• Colouring square-free graphs without long induced paths. (Q3304134) (← links)
• On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size (Q4973236) (← links)
• Efficient solvability of the weighted vertex coloring problem for some hereditary class of graphs with $5$-vertex prohibitions (Q5090159) (← links)
• Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem (Q5090168) (← links)
• Efficient solvability of the weighted vertex coloring problem for some two hereditary graph classes (Q5100120) (← links)
• $(2P_2,K_4)$-Free Graphs are 4-Colorable (Q5232143) (← links)
• Colouring graphs of bounded diameter in the absence of small cycles (Q5918661) (← links)
• Colouring graphs of bounded diameter in the absence of small cycles (Q5925681) (← links)
• Two cases of polynomial-time solvability for the coloring problem (Q5963654) (← links)