Funder
NSFC, China
Department of Education of Jiangxi Province, China
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference18 articles.
1. Colorings of plane graphs: A survey;Borodin;Discrete Math.,2013
2. Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable;Borodin;Sib.Èlektron. Mat. Izv.,2006
3. Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable;Borodin;Discrete Math.,2010
4. A sufficient condition for planar graphs to be 3-colorable;Borodin;J. Combin. Theory Ser. B,2003
5. Steinberg’s conjecture is false;Cohen-Addad;J. Combin. Theory B,2017
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献