Funder
National Natural Science Foundation of China
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference22 articles.
1. A sufficient condition for planar graphs to be 3-colorable;Borodin;J. Comb. Theory, Ser. B,2003
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. Colorings of planar graphs: a survey;Borodin;Discrete Math.,2013
5. Planar graphs without cycles of length 4 or 5 are (2,0,0)-colorable;Chen;Discrete Math.,2016