The following pages link to (Q3558598):
Displaying 50 items.
- 4-colorability of \(P_6\)-free graphs (Q322185) (← links)
- Complexity of coloring graphs without paths and cycles (Q344861) (← links)
- Vertex coloring of graphs with few obstructions (Q344868) (← 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)
- 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)
- Graphs with large girth are \(b\)-continuous (Q510951) (← links)
- The induced separation dimension of a graph (Q722529) (← 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)
- Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four (Q831869) (← links)
- Complexity classification of the edge coloring problem for a family of graph classes (Q1675533) (← links)
- The \(b\)-continuity of graphs with large girth (Q1684929) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- Three-coloring and list three-coloring of graphs without induced paths on seven vertices (Q1786047) (← links)
- Graphs with girth at least 8 are b-continuous (Q2132404) (← links)
- \(b\)-continuity and partial Grundy coloring of graphs with large girth (Q2185922) (← links)
- Better 3-coloring algorithms: excluding a triangle and a seven vertex path (Q2216431) (← links)
- Coloring vertices of claw-free graphs in three colors (Q2251141) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- List coloring in the absence of a linear forest (Q2258070) (← links)
- \(H\)-colouring \(P_t\)-free graphs in subexponential time (Q2322884) (← 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)
- Certifying coloring algorithms for graphs without long induced paths (Q2414471) (← links)
- Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
- Boundary properties of the satisfiability problems (Q2450928) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- 3-colouring \(P_t\)-free graphs without short odd cycles (Q2696271) (← links)
- 4-Coloring H-Free Graphs When H Is Small (Q2891376) (← links)
- Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
- Colouring Vertices of Triangle-Free Graphs (Q3057624) (← links)
- Coloring Graphs without Short Cycles and Long Induced Paths (Q3088283) (← links)
- List Coloring in the Absence of a Linear Forest (Q3104770) (← links)
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs (Q3181051) (← links)
- 3-Colorable Subclasses of $P_8$-Free Graphs (Q4641762) (← links)
- On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size (Q4973236) (← links)
- (Q5075768) (← links)
- Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem (Q5090168) (← links)
- Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph (Q5099103) (← links)
- Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs (Q5216779) (← links)
- (Q5874489) (← links)
- (Q5878618) (← links)
- Approximately coloring graphs without long induced paths (Q5915792) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5918661) (← links)
