Abstract
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps containing empires formed by exactly r > 1 countries each. We prove that the problem can be solved in polynomial time using s colours on maps whose underlying adjacency graph has no induced subgraph of average degree larger than s/r. However, if s ≥ 3, the problem is NP-hard for forests of paths of arbitrary lengths (if s < r) for trees (if r ≥ 2 and s < 2r) and arbitrary planar graphs (if s < 7 for r = 2, and s < 6r − 3, for r ≥ 3). The result for trees shows a perfect dichotomy (the problem is NP-hard if 3 ≤ s ≤ 2r − 1 and polynomial time solvable otherwise). The one for planar graphs proves the NP-hardness of colouring with less than 7 colours graphs of thickness two and less than 6r − 3 colours graphs of thickness r ≥ 3.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beineke, L.W.: Biplanar graphs: a survey. Computers and Mathematical Applications 34(11), 1–8 (1997)
Beineke, L.W., Harary, F.: The thickness of the complete graph. Canadian Journal of Mathematics 17, 850–859 (1965)
Brooks, R.L.: On colouring the nodes of a network. Proc. Cambridge Phil. Soc. 37, 194–197 (1941)
Bryant, D.E.: Cycle decompositions of the complete graphs. In: Hilton, A.J.W., Talbot, J.M. (eds.) Surveys in Combinatorics. London Mathematical Society Lecture Notes Series, vol. 346, pp. 67–97. Cambridge University Press (2007)
Cooper, C., McGrae, A.R.A., Zito, M.: Martingales on Trees and the Empire Chromatic Number of Random Trees. In: Kutyłowski, M., Gebala, M., Charatonik, W. (eds.) FCT 2009. LNCS, vol. 5699, pp. 74–83. Springer, Heidelberg (2009)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. M.I.T. Press (2009)
Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173. Springer, Heidelberg (1999)
Garey, M.R., Johnson, D.S.: Computer and Intractability, a Guide to the Theory of NP-Completeness. Freeman and Company (1979)
Gibbons, A.M.: Algorithmic Graph Theory. Cambridge University Press (1985)
Heawood, P.J.: Map colour theorem. Quarterly Journal of Pure and Applied Mathematics 24, 332–338 (1890)
Hutchinson, J.P.: Coloring ordinary maps, maps of empires, and maps of the moon. Mathematics Magazine 66(4), 211–226 (1993)
Jackson, B., Ringel, G.: Solution of Heawood’s empire problem in the plane. Journal für die Reine und Angewandte Mathematik 347, 146–153 (1983)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)
Lovász, L.: Combinatorial Problems and Exercises, 2nd edn. North-Holland (1993)
Lucas, E.: Récreations Mathématiqués, vol. II. Gauthier-Villars (1892)
McGrae, A.R., Zito, M.: Colouring Random Empire Trees. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 515–526. Springer, Heidelberg (2008)
McGrae, A.R.A.: Colouring Empires in Random Trees. PhD thesis, Department of Computer Science, University of Liverpool as technical report ULCS-10-007 (2010), http://www.csc.liv.ac.uk/research/techreports/techreports.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McGrae, A.R.A., Zito, M. (2011). Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem. In: Kolman, P., Kratochvíl, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 2011. Lecture Notes in Computer Science, vol 6986. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25870-1_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-25870-1_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25869-5
Online ISBN: 978-3-642-25870-1
eBook Packages: Computer ScienceComputer Science (R0)