Author:
Miao Zhengke,Wang Yingqian,Zhang Chuanni,Zhang Huajun
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference17 articles.
1. Every planar map is four colorable, I, discharging;Appel;Illinois J. Math.,1977
2. Graph Theory;Bondy,2008
3. Colorings of plane 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. A sufficient condition for planar graphs to be 3-colorable;Borodin;J. Combin. Theory Ser. B,2003
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献