Kempe revisited

被引:7
作者
Hutchinson, J [1 ]
Wagon, S [1 ]
机构
[1] Macalester Coll, St Paul, MN 55105 USA
关键词
D O I
10.2307/2589650
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A practical way of colouring any map is this. Number the districts in succession, always numbering a district which has less than six boundaries, not including those boundaries which have a district already numbered on the other side of them. When the whole map is numbered, beginning sith the highest number, letter the districts in succession with four letters, a, b, c, d, rearranging the letters whenever a district has four round it. so that it may have only three, leaving one to letter the district with. When thr whole map is lettered, colour the districts, using different colors for districts lettered differently.
引用
收藏
页码:170 / 174
页数:5
相关论文
共 9 条
[1]  
[Anonymous], 1976, GRAPH THEORY 1736 19
[2]   Fermat's last theorem, the four color conjecture, and Bill Clinton for April fools' day [J].
Burger, EB ;
Morgan, F .
AMERICAN MATHEMATICAL MONTHLY, 1997, 104 (03) :246-255
[3]  
ERRERA A, 1921, THESIS GAUTHIERVILLA
[4]  
HUTCHINSON JP, 1997, MATH ED RES, V6, P42
[5]  
KITTELL I, 1935, B AM MATH SOC, V41, P407
[6]  
Matula David W, 1972, GTC, P109
[7]  
MORGENSTERN CA, 1991, ALGORITHMICA, V6, P869, DOI 10.1007/BF01759077
[8]  
ROBERTSON N, 1996, ELECT RES ANNOUNC AM, V2, P17
[9]  
SAATY TL, 1977, FOUR COLOR PROBLEM A