Author:
Huang Ziwen,Liu Runrun,Wang Gaozhen
Funder
NSFC, China
Department of Education of Jiangxi Province, China
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference23 articles.
1. Every planar map is four colorable, Part I. Discharging;Appel;Illinois J. Math.,1977
2. Every planar map is four colorable, Part II. Reducibility;Appel;Illinois J. Math.,1977
3. Colorings of planar graphs: a survey;Borodin;Discrete Math.,2013
4. Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable;Borodin;Sib. Elektron. Mat. Izv.,2006
5. Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable;Borodin;Discrete Math.,2010
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献