Share  Bookmark

 Download from



[1] O. V. Borodin and D. R. Woodall, Thirteen colouring numbers for outerplane graphs, Bull. Inst. Combin. Appl. 14 (1995), 87100.
[2] O. V. Borodin, Solution of Ringel's problem on vertexface colouring of plane graphs and colouring of 1planar graphs (in Russian), Metody Diskret. Analiz. 41 (1984), 1226.
[3] G. A. Dirac, A property of 4chromatic graphs and some remarks on critical graphs, J. London Math. Soc. 27 (1952), 8592.
[4] P. Erd˝os, A. L. Rubin and H. Taylor, Choosability in graphs, Proc. West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata, 1979, Congr. Numer. 26 (1980), 125157.
[5] T. J. Hetherington, Listcolourings of nearouterplanar graphs, PhD Thesis, University of Nottingham, 2006.
[6] T. J. Hetherington, Coupled choosability of nearouterplane graphs, submitted February 2007.
[7] T. J. Hetherington, Edgeface choosability of nearouterplane graphs, submitted February 2007.
[8] T. J. Hetherington and D. R. Woodall, Edge and total choosability of nearouterplanar graphs, Electr. J. Combin. 13 (2006), #R98, 7pp.
[9] H. V. Kronk and J. Mitchem, The entire chromatic number of a normal graph is at most seven, Bull. Amer. Math. Soc. 78 (1972), 799800.
[10] H. V. Kronk and J. Mitchem, A sevencolour theorem on the sphere, Discrete Math. 5 (1973), 253260.