1. N. Alon and M. Tarsi: Colorings and orientations of graphs, Combinatorica 12 (1992), 125–134.
2. R. L. Brooks: On colouring the nodes of a network, Mathematical Proceedings of the Cambridge Philosophical Society, vol. 37, Cambridge Univ Press, 1941, 194–197.
3. D. W. Cranston and D. B. West: An introduction to the discharging method via graph coloring, Discrete Math 340 (2017), 766–793. extended version: A guide to the discharging method, https://arxiv.org/abs/1306.4434v1 (2013).
4. G. A. Dirac: A theorem of R. L. Brooks and a conjecture of H. Hadwiger, Proceedings of the London Mathematical Society 3 (1957), no. 1, 161–195.
5. P. Erdős, A. L. Rubin and H. Taylor: Choosability in graphs, Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium, vol. 26, 1979, 125–157.