Author:
Zhang Ganchao,Chen Min,Wang Weifan
Funder
Natural Science Foundation of Zhejiang Province
National Natural Science Foundation of China
Reference21 articles.
1. Every planar map is four colorable. I. Discharging;Appel;Ill. J. Math.,1977
2. Every planar map is four colorable. II. Reducibility;Appel;Ill. J. Math.,1977
3. Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k;Borodin;J. Graph Theory,2010
4. Defective 2-colorings of sparse graphs;Borodin;J. Comb. Theory, Ser. B,2014
5. (1,k)-coloring of graphs with girth at least five on a surface;Choi;J. Graph Theory,2017
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Planar Graphs without Cycles of Length 3, 4, and 6 are (3, 3)-Colorable;International Journal of Mathematics and Mathematical Sciences;2024-05-09