Publisher
Springer International Publishing
Reference34 articles.
1. R. Alalqam, Heuristic methods applied to difficult graph theory problems. M.S. Thesis, University of Colorado Denver, 2012
2. M.O. Albertson, D.L. Boutin, E. Gethner, The thickness and chromatic number of r-inflated graphs. Discrete Math. 310(20), 2725–2734 (2010)
3. B. Alspach, The wonderful Walecki construction. Bull. Inst. Combin. Appl. 52, 7–20 (2008)
4. K. Appel, W. Haken, Every planar map is four colorable. Bull. Am. Math. Soc. 82(5), 711–712 (1976)
5. K. Appel, W. Haken, A proof of the four color theorem. Discrete Math. 16(2), 179–180 (1976)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Biplanarity of Blowups;Lecture Notes in Computer Science;2023