Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference16 articles.
1. On continuation of 3-colouring of planar graphs;Aksionov;Diskretn. Anal. Novosibirsk,1974
2. Some counterexamples associated with the three color problem;Aksionov;J. Combin. Theory Ser. B,1980
3. Every planar map is four colorable, Part I: discharging;Appel;Illinois J. Math.,1977
4. Every planar map is four colorable, Part II: reducibility;Appel;Illinois J. Math.,1977
5. Z. Dvořák, K. Kawarabayashi, Choosability of planar graphs of girth 5, manuscript.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献