Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference19 articles.
1. Every planar map is four colorable;Appel;Bull. Amer. Math. Soc.,1976
2. Simultaneous coloring of edges and faces of plane graphs;Borodin;Discrete Math.,1994
3. List edge and list total clearing’s of autograph’s;Borodin;J. Combin. Theory Ser. B,1997
4. Map-color theorem;Heawood;Quart. J. Math.,1890
5. Graphs of degree 4 are 5-edge-choosable;Juvan;J. Graph Theory,1999
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献