Funder
National Natural Science Foundation of China
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference15 articles.
1. Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k;Borodin;J. Graph Theory,2010
2. Defective 2-coloring of sparse graphs;Borodin;J. Comb. Theory, Ser. B,2014
3. Planar graphs without cycles of length 4 or 5 are (2, 0,0)-colorable;Chen;Discrete Math.,2016
4. (1,k)-coloring of graphs with girth at least five on a surface;Choi;J. Graph Theory,2017
5. Planar graph with girth at least 5 are (3, 5)-colorable;Choi;Discrete Math.,2015
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献