Funder
Russian Science Foundation
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference23 articles.
1. On the extension of a 3-coloring from two vertices in a triangle-free planar graph;Aksenov;Diskretn. Anal. Issled. Oper. Ser. 1.,2002
2. Every planar map is four colorable. Part I: Discharging;Appel;Illinois J. Math.,1977
3. Every planar map is four colorable. Part II: Reducibility;Appel;Illinois J. Math.,1977
4. Splitting planar graphs of girth 6 into two linear forests with short paths;Axenovich;J. Graph Theory,2017
5. A new proof of Grünbaum’s 3 color theorem;Borodin;Discrete Math.,1997
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献