Author:
Albertson Michael O.,Boutin Debra L.,Gethner Ellen
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference28 articles.
1. The thickness of an arbitrary complete graph;Alekseev;Mat. Sb. (N.S.),1976
2. Every planar map is four colorable;Appel;Bull. Amer. Math. Soc.,1976
3. A proof of the four color theorem;Appel;Discrete Math.,1976
4. Supplement to: “Every planar map is four colorable. I Discharging”;Appel;Illinois J. Math.,1977
5. II. Reducibility;Appel;Illinois J. Math.,1977
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Biplanarity of Blowups;Lecture Notes in Computer Science;2023
2. Analyzing b-continuity for some inflated graphs;2ND INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS: ICMTA2021;2022
3. To the Moon and Beyond;Graph Theory;2018
4. Hadwiger’s Conjecture for inflations of 3-chromatic graphs;European Journal of Combinatorics;2016-01
5. An Annotated Bibliography on the Thickness, Outerthickness, and Arboricity of a Graph;Missouri Journal of Mathematical Sciences;2012-05-01