Author:
Albertson Michael O.,Boutin Debra L.
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference8 articles.
1. M.O. Albertson, People who know people, Math. Mag., to appear.
2. K. Appel, and W. Haken, Every planar map is four colorable: Part 1, Discharging, Illinois J. Math. 21, 429–490.
3. K. Appel, W. Haken, and J. Koch, Every planar map is four colorable: Part 2, Reducibility, Illinois J. Math. 21, 491–567.
4. Graph Theory with Applications;Bondy,1976
5. Computers and Intractibility: A Guide to the Theory of NP-Completeness;Garey,1979
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献