Volume 24 • Number 1 • 2001   • Uniquely N-colorable and Chromatically Equivalent Graphs Chong-Yun Chao Abstract. For each integer we present a uniquely n-colorable graph with vertices, and their generalizations. For each integer we present two uniquely graphs which are chromatically equivalent with vertices, and with vertices, and their generalizations. Full text: PDF