Pages that link to "Item:Q2978179"

The following pages link to A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179):

Displaying 50 items.

• Polynomial cases for the vertex coloring problem (Q666663) (← 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)
• The weighted coloring problem for two graph classes characterized by small forbidden induced structures (Q1671374) (← 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)
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
• Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
• Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
• Three-coloring and list three-coloring of graphs without induced paths on seven vertices (Q1786047) (← links)
• The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
• On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
• Hard problems that quickly become very easy (Q2059897) (← links)
• Injective colouring for H-free graphs (Q2117071) (← links)
• Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4 (Q2124634) (← links)
• A branch and price algorithm for list coloring problem (Q2132397) (← links)
• An intractability result for the vertex 3-colourability problem (Q2136878) (← 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)
• Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
• Better 3-coloring algorithms: excluding a triangle and a seven vertex path (Q2216431) (← links)
• List 3-coloring graphs with no induced \(P_6 + rP_3\) (Q2223697) (← links)
• List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
• Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments (Q2273901) (← links)
• Obstructions for three-coloring graphs without induced paths on six vertices (Q2284725) (← links)
• The intersection of two vertex coloring problems (Q2303434) (← links)
• Colouring square-free graphs without long induced paths (Q2323345) (← links)
• DP-degree colorable hypergraphs (Q2333798) (← 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)
• Certifying coloring algorithms for graphs without long induced paths (Q2414471) (← links)
• Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
• Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
• The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size (Q2685343) (← links)
• 3-colouring \(P_t\)-free graphs without short odd cycles (Q2696271) (← links)
• On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
• Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
• Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← 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)
• (Q5075768) (← 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)