Figures from this paper
References
SHOWING 1-10 OF 12 REFERENCES
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
- MathematicsComb. Probab. Comput.
- 1998
For any integer k, it is deduced that, unless NP=RP, no polynomial time algorithm for k-Colourability on graphs G of girth g(G)≥log∣G∣/13logk and maximum degree Δ( G)≤6k13 can exist.
Kr-Free Uniquely Vertex Colorable Graphs with Minimum Possible Edges
- MathematicsJ. Comb. Theory, Ser. B
- 2001
Counterexamples to the conjecture of Xu that every uniquely r-colorable graph of order n with exactly (r?1)n?(r2) edges must contain a Kr. Combin. Theory Ser. B50 conjecture are constructed.
On uniquely colorable graphs without short cycles
- 1973
Uniquely Colourable Graphs with Large Girth
- MathematicsCanadian Journal of Mathematics
- 1976
Tutte [1], writing under a pseudonym, was the first to prove that a graph with a large chromatic number need not contain a triangle. The result was rediscovered by Zykov [5] and Mycielski [4]. Erdös…
On uniquely colorable graphs without short cycles
- asopis pro pstovn matematiky 98.2
- 1973
Tiling Turn theorems
- Combinatorica 20.2
- 2000