Author:
Bernhart Frank,Kainen Paul C
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference6 articles.
1. On the book thicknesses of various graphs;Ollmann,1973
2. An inequality for the chromatic number of a graph;Szekeres;J. Combinatorial Theory,1968
3. Every planar map is four colorable, I and II;Haken;Ill. J. of Math.,1977
4. A numerical equivalent of the four color map problem;Whitney;Monat. Math. Phys.,1937
Cited by
235 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献