A construction of uniquely colourable graphs with equal colour class sizes

@article{Mohr2021ACO,
  title={A construction of uniquely colourable graphs with equal colour class sizes},
  author={Samuel Mohr},
  journal={Discret. Appl. Math.},
  year={2021},
  volume={303},
  pages={122-126}
}
  • Samuel Mohr
  • Published 23 January 2020
  • Mathematics
  • Discret. Appl. Math.

Figures from this paper

References

SHOWING 1-10 OF 12 REFERENCES
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
TLDR
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.
On Uniquely Colorable Planar Graphs
Kr-Free Uniquely Vertex Colorable Graphs with Minimum Possible Edges
TLDR
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.
Tiling Turán Theorems
H in a large graph G.
On uniquely colorable graphs without short cycles
  • 1973
Uniquely Colourable Graphs with Large Girth
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
The size of uniquely colorable graphs
Uniquely colorable graphs
Tiling Turn theorems
  • Combinatorica 20.2
  • 2000
...
...