The following pages link to (Q4448764):
Displaying 50 items.
- List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- Constructions of \(k\)-critical \(P_5\)-free graphs (Q2255047) (← links)
- List coloring in the absence of a linear forest (Q2258070) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- \(H\)-colouring \(P_t\)-free graphs in subexponential time (Q2322884) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- Efficient approximation for restricted biclique cover problems (Q2331611) (← links)
- Domination, coloring and stability in \(P_5\)-reducible graphs (Q2341757) (← links)
- Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes (Q2345603) (← links)
- The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (Q2352049) (← links)
- On line graphs of subcubic triangle-free graphs (Q2400553) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (Q2409536) (← links)
- Reducing the chromatic number by vertex or edge deletions (Q2413179) (← links)
- On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
- Solving the clique cover problem on (bull, \(C_4\))-free graphs (Q2414459) (← links)
- Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
- List coloring in the absence of two subgraphs (Q2636800) (← links)
- On the complexity of colouring antiprismatic graphs (Q2659773) (← links)
- Non-empty intersection of longest paths in \(H\)-free graphs (Q2692169) (← links)
- 3-colouring \(P_t\)-free graphs without short odd cycles (Q2696271) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions (Q2835660) (← links)
- 4-Coloring H-Free Graphs When H Is Small (Q2891376) (← links)
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
- Contraction Blockers for Graphs with Forbidden Induced Paths (Q2947020) (← links)
- max-cut and Containment Relations in Graphs (Q3057609) (← links)
- Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs (Q3057613) (← 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)
- Choosability of P 5-Free Graphs (Q3182940) (← links)
- Colouring square-free graphs without long induced paths. (Q3304134) (← links)
- A Note on k-Colorability of P 5-Free Graphs (Q3599143) (← links)
- (Q3839008) (← links)
- The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs (Q4632025) (← links)
- 3-Colorable Subclasses of $P_8$-Free Graphs (Q4641762) (← links)
- (Q4691865) (← links)
- On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size (Q4973236) (← links)
- Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes (Q5089235) (← 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)
- Colouring (P_r+P_s)-Free Graphs (Q5090995) (← links)
- Colouring H-free graphs of bounded diameter. (Q5092372) (← links)
- Efficient solvability of the weighted vertex coloring problem for some two hereditary graph classes (Q5100120) (← links)
- On Betti numbers of flag complexes with forbidden induced subgraphs (Q5115548) (← links)
- Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs (Q5216779) (← links)
