Cai, J., & Meyer, G. E. (1985). Graph minimal uncolorability is Dp-complete.
Chicago Style (17th ed.) CitationCai, Jin-Yi, and Gabriele E. Meyer. Graph Minimal Uncolorability Is Dp-complete. Ithaca, NY, 1985.
MLA (9th ed.) CitationCai, Jin-Yi, and Gabriele E. Meyer. Graph Minimal Uncolorability Is Dp-complete. 1985.
Warning: These citations may not always be 100% accurate.