Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference6 articles.
1. Map colour theorem;Heawood;Quart. J. Math.,1890
2. A lower bound for crossing numbers of graphs with applications to Kn, Kp,q and Q(d);Kainen;J. Combinatorial Theory Ser. B,1972
3. Solution of the Heawood map-coloring problem;Ringel,1968
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献