Pages that link to "Item:Q4238167"
From MaRDI portal
The following pages link to Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth (Q4238167):
Displayed 42 items.
- First-fit colorings of graphs with no cycles of a prescribed even length (Q326475) (← links)
- The complexity of changing colourings with bounded maximum degree (Q407523) (← links)
- Colouring graphs when the number of colours is almost the maximum degree (Q462929) (← links)
- Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker (Q472396) (← links)
- On graphs without a \(C_{4}\) or a diamond (Q531598) (← links)
- \(H\)-coloring degree-bounded (acyclic) digraphs (Q744083) (← links)
- Dichotomy for bounded degree \(H\)-colouring (Q1003659) (← links)
- Trees, paths, stars, caterpillars and spiders (Q1635718) (← links)
- On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
- (\(\Delta-k\))-critical graphs (Q1767668) (← links)
- On the Grundy and \(b\)-chromatic numbers of a graph (Q1949739) (← links)
- A construction of uniquely colourable graphs with equal colour class sizes (Q1983120) (← links)
- Star colouring of bounded degree graphs and regular graphs (Q2124639) (← 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)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- A novel giant-subgraph phase-transition in sparse random \(k\)-partite graphs (Q2581553) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- Function simulation, graph grammars and colourings (Q2855758) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- On the Grundy Number of a Graph (Q3058701) (← links)
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs (Q3181051) (← links)
- DP-Complete Problems Derived from Extremal NP-Complete Properties (Q3182925) (← links)
- Colouring square-free graphs without long induced paths. (Q3304134) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models (Q4969061) (← links)
- (Q5005166) (← links)
- (Q5090456) (← links)
- Colouring (P_r+P_s)-Free Graphs (Q5090995) (← links)
- Colouring H-free graphs of bounded diameter. (Q5092372) (← 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)
- Bounds for the Grundy chromatic number of graphs in terms of domination number (Q6073792) (← links)
- The complexity of star colouring in bounded degree graphs and regular graphs (Q6102265) (← links)
- Distributed algorithms, the Lovász local lemma, and descriptive combinatorics (Q6107878) (← links)
- Hardness transitions and uniqueness of acyclic colouring (Q6145810) (← links)
- On the price of independence for vertex cover, feedback vertex set and odd cycle transversal (Q6181986) (← links)