Map-Colour Theorems
- 1 January 1952
- journal article
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 4, 480-490
- https://doi.org/10.4153/cjm-1952-043-9
Abstract
A map wil be calledk-chromatic or said to have chromatic numberkifkis the least positive integer having the property that the countries of the map can be divided intokmutually disjoint (colour) classes in such a way that no two countries which have a common frontier line are in the same (colour) class.Heawood [4] proved that forh> 1 the chromatic number of a map on a surface of connectivityhis at mostnh, whereKeywords
This publication has 7 references indexed in Scilit:
- Some Theorems on Abstract GraphsProceedings of the London Mathematical Society, 1952
- The map-coloring of unorientable surfacesDuke Mathematical Journal, 1943
- On colouring the nodes of a networkMathematical Proceedings of the Cambridge Philosophical Society, 1941
- ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNSAnnals of Eugenics, 1939
- A Note on the Heawood Color FormulaJournal of Mathematics and Physics, 1935
- Anschauliche GeometriePublished by Springer Nature ,1932
- Ueber das Problem der NachbargebieteMathematische Annalen, 1891