Map-Colour Theorems
暂无分享,去创建一个
A map wil be called k-chromatic or said to have chromatic number k if k is the least positive integer having the property that the countries of the map can be divided into k mutually 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 for h > 1 the chromatic number of a map on a surface of connectivity h is at most n h, where
[1] H. Tietze,et al. Einige Bemerkungen über das Problem des Kartenfärbens auf einseitigen Flächen. , 2022 .
[2] R. L. Brooks. On colouring the nodes of a network , 1941, Mathematical Proceedings of the Cambridge Philosophical Society.
[3] P. J. Heawood. Map-Colour Theorem , 1949 .
[4] Paul Erdös,et al. A colour problem for infinite graphs and a problem in the theory of relations , 1951 .
[5] G. Dirac. Some Theorems on Abstract Graphs , 1952 .