Abstract
Heawood (3) showed that for h > 1 the countries of any
map on a surface of connectivity h = 3 − x
can be coloured using at mostcolours. In a previous paper (1)1 proved the following
Publisher
Canadian Mathematical Society
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献