Pages that link to "Item:Q1079363"

The following pages link to The complexity of colouring problems on dense graphs (Q1079363):

Displaying 45 items.

• Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
• 4-colorability of \(P_6\)-free graphs (Q322185) (← links)
• Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995) (← links)
• \(H\)-colorings of dense hypergraphs (Q456171) (← links)
• Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← links)
• Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← links)
• Efficiency in exponential time for domination-type problems (Q1003475) (← links)
• Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs (Q1116690) (← links)
• A randomised 3-colouring algorithm (Q1117242) (← links)
• Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
• Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\) (Q1351969) (← links)
• 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. (Q1427186) (← links)
• Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
• Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
• Three-coloring and list three-coloring of graphs without induced paths on seven vertices (Q1786047) (← links)
• The sandwich problem for decompositions and almost monotone properties (Q1799213) (← links)
• Dominating set based exact algorithms for \(3\)-coloring (Q1944084) (← 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)
• 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)
• List 3-coloring graphs with no induced \(P_6 + rP_3\) (Q2223697) (← links)
• 4-Coloring H-Free Graphs When H Is Small (Q2891376) (← links)
• 4‐Coloring <i>P</i> ₆ ‐Free Graphs with No Induced 5‐Cycles (Q2978175) (← links)
• Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs (Q3057613) (← links)
• The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree (Q3057634) (← links)
• A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs (Q4314146) (← links)
• Coloring bipartite hypergraphs (Q4645934) (← links)
• Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case (Q4845083) (← links)
• (Q5075768) (← 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)
• Independent Feedback Vertex Set for P_5-free Graphs (Q5136232) (← links)
• Faster 3-Coloring of Small-Diameter Graphs (Q5866453) (← links)
• Approximately coloring graphs without long induced paths (Q5915792) (← links)
• Colouring graphs of bounded diameter in the absence of small cycles (Q5918661) (← links)
• Acyclic, star, and injective colouring: bounding the diameter (Q5918693) (← links)
• Acyclic, star, and injective colouring: bounding the diameter (Q5925554) (← links)
• Colouring graphs of bounded diameter in the absence of small cycles (Q5925681) (← 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)
• Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
• List 3-coloring on comb-convex and caterpillar-convex bipartite graphs (Q6591467) (← links)