The following pages link to (Q4448764):
Displaying 50 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)
- On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs (Q344847) (← links)
- Complexity of coloring graphs without paths and cycles (Q344861) (← links)
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs (Q344864) (← links)
- Vertex coloring of graphs with few obstructions (Q344868) (← links)
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- A decidability result for the dominating set problem (Q410736) (← links)
- Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995) (← links)
- \textsc{max-cut} and containment relations in graphs (Q441861) (← 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)
- The coloring problem for classes with two small obstructions (Q479257) (← links)
- Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Some new hereditary classes where graph coloring remains NP-hard (Q556851) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- Connected greedy coloring of \(H\)-free graphs (Q777440) (← links)
- Algorithms for the rainbow vertex coloring problem on graph classes (Q820548) (← links)
- The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (Q848637) (← links)
- Stable sets in \(k\)-colorable \(P_{5}\)-free graphs (Q990082) (← links)
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. (Q1427186) (← 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)
- Towards an isomorphism dichotomy for hereditary graph classes (Q1693994) (← links)
- Colouring of \((P_3 \cup P_2)\)-free graphs (Q1706425) (← links)
- On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
- Critical vertices and edges in \(H\)-free graphs (Q1730263) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
- On the algorithmic aspects of strong subcoloring (Q1752633) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
- Three-coloring and list three-coloring of graphs without induced paths on seven vertices (Q1786047) (← links)
- 3-colouring AT-free graphs in polynomial time (Q1934316) (← links)
- The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
- On coloring a class of claw-free and hole-twin-free graphs (Q2091797) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Injective colouring for H-free graphs (Q2117071) (← links)
- On coloring a class of claw-free graphs. (Q2132368) (← links)
- Graph clustering via generalized colorings (Q2136276) (← links)
- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs (Q2138579) (← links)
- Partitioning \(H\)-free graphs of bounded diameter (Q2166756) (← links)
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter (Q2167905) (← links)
- Regular pattern-free coloring (Q2172395) (← links)
- On the complexity of cd-coloring of graphs (Q2181255) (← links)
- Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
- Better 3-coloring algorithms: excluding a triangle and a seven vertex path (Q2216431) (← links)
