Pages that link to "Item:Q2440105"

The following pages link to Coloring graphs without short cycles and long induced paths (Q2440105):

Displaying 22 items.

• Complexity of coloring graphs without paths and cycles (Q344861) (← links)
• Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← links)
• Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter (Q2167905) (← 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 \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
• Colouring square-free graphs without long induced paths (Q2323345) (← links)
• Certifying coloring algorithms for graphs without long induced paths (Q2414471) (← links)
• New formulations and branch-and-cut procedures for the longest induced path problem (Q2669795) (← 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)
• 4‐Coloring <i>P</i> ₆ ‐Free Graphs with No Induced 5‐Cycles (Q2978175) (← links)
• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
• Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs (Q3181051) (← links)
• Colouring square-free graphs without long induced paths. (Q3304134) (← links)
• 3-Colorable Subclasses of $P_8$-Free Graphs (Q4641762) (← links)
• (Q5874489) (← links)
• Colouring graphs of bounded diameter in the absence of small cycles (Q5918661) (← 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)
• Colouring graphs of bounded diameter in the absence of small cycles (Q5925681) (← links)
• MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)