Pages that link to "Item:Q2252529"

The following pages link to Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529):

Displaying 26 items.

• Solving problems on graphs of high rank-width (Q1709595) (← links)
• Three-coloring and list three-coloring of graphs without induced paths on seven vertices (Q1786047) (← links)
• Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
• List 3-coloring \(P_t\)-free graphs with no induced 1-subdivision of \(K_{1 , s}\) (Q2198407) (← 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)
• Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs (Q2227825) (← links)
• List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
• Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
• Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
• Certifying coloring algorithms for graphs without long induced paths (Q2414471) (← links)
• Non-empty intersection of longest paths in \(H\)-free graphs (Q2692169) (← links)
• Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
• Solving Problems on Graphs of High Rank-Width (Q3449829) (← links)
• (Q5075768) (← links)
• Colouring (P_r+P_s)-Free Graphs (Q5090995) (← links)
• Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph (Q5099103) (← links)
• Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
• Parameterized Pre-Coloring Extension and List Coloring Problems (Q5857010) (← links)
• (Q5874504) (← links)
• On 3-coloring of \((2P_4,C_5)\)-free graphs (Q5918691) (← links)
• On 3-coloring of \((2P_4,C_5)\)-free graphs (Q5925555) (← links)
• Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658) (← links)
• Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring (Q6122199) (← links)
• Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring (Q6154191) (← links)