Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference17 articles.
1. Every planar map is four colorable. Part I: Discharging;Appel;Illinois J. Math.,1977
2. Every planar map is four colorable. Part II: Reducibility;Appel;Illinois J. Math.,1977
3. Computer Algorithms: Introduction to Design and Analysis;Baase,1978
4. On coloring the nodes of a network;Brooks;Proc. Cambridge Philos. Soc.,1941
5. A greedy-heuristic for the set-covering problem;Chvátal;Math. Operations Research,1979
Cited by
170 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献