Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference25 articles.
1. Every planar map is four colorable. Part I. Discharging;Appel;Ill. J. Math.,1977
2. Every planar map is four colorable. Part II. Reducibility;Appel;Ill. J. Math.,1977
3. Hajós' graph colouring conjecture: variations and counterexamples;Catlin;J. Comb. Theory, Ser. B,1979
4. On the odd-minor variant of Hadwiger's conjecture;Geelen;J. Comb. Theory, Ser. B,2009
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献