Funder
Czech Science Foundation
Czech Ministry of Education
NSF
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference26 articles.
1. On continuation of 3-colouring of planar graphs;Aksionov;Diskretn. Anal. Novosib.,1974
2. Some counterexamples associated with the three color problem;Aksionov;J. Comb. Theory, Ser. B,1980
3. You can't paint yourself into a corner;Albertson;J. Comb. Theory, Ser. B,1998
4. Irreducible graphs in the Grünbaum-havel 3-colour problem;Borodin;Discrete Math.,1996
5. A new proof of Grünbaum's 3 color theorem;Borodin;Discrete Math.,1997
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献