Pages that link to "Item:Q1786047"

The following pages link to Three-coloring and list three-coloring of graphs without induced paths on seven vertices (Q1786047):

Displaying 50 items.

• The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
• Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
• Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
• On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
• On coloring a class of claw-free and hole-twin-free graphs (Q2091797) (← links)
• An intractability result for the vertex 3-colourability problem (Q2136878) (← links)
• Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter (Q2167905) (← links)
• Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
• Vertex coloring of a graph for memory constrained scenarios (Q2183733) (← 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)
• Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs (Q2222949) (← 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)
• Obstructions for three-coloring graphs without induced paths on six vertices (Q2284725) (← links)
• Coloring of pseudocubic graphs in three colors (Q2287152) (← links)
• Colouring square-free graphs without long induced paths (Q2323345) (← 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)
• 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)
• 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)
• Colouring square-free graphs without long induced paths. (Q3304134) (← 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)
• Colouring (P_r+P_s)-Free Graphs (Q5090995) (← links)
• Colouring H-free graphs of bounded diameter. (Q5092372) (← 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)
• Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs (Q5216779) (← links)
• (Q5874504) (← links)
• Approximately coloring graphs without long induced paths (Q5915792) (← links)
• \(k\)-critical graphs in \(P_5\)-free graphs (Q5918256) (← 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)
• \(k\)-critical graphs in \(P_5\)-free graphs (Q5925505) (← 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)
• A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs (Q6039897) (← links)
• Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658) (← links)
• MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
• Infinite families of \(k\)-vertex-critical \((P_5, C_5)\)-free graphs (Q6121915) (← 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)
• Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs (Q6180578) (← links)
• List 3-coloring on comb-convex and caterpillar-convex bipartite graphs (Q6591467) (← links)