Author:
Boutin Debra L.,Gethner Ellen,Sulanke Thom
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference23 articles.
1. Special announcement
2. Hajós' graph-coloring conjecture: Variations and counterexamples
3. Mathematical Games
4. and , Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H.Freeman & Co., New York, NY, 1990.
5. , and , Some simplified NP-complete problems, In: STOC'74: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, ACM Press, New York, NY, USA, 1974, pp. 47–63.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献