Conference Paper:

M. B. Dillencourt and W. D. Smith, A linear-time algorithm for testing the inscribability of trivalent polyhedra, in Proceedings of the Eighth ACM Symposium on Computational Geometry, Berlin, Germany, June 1992, 177-185.

Updated Version:

M. B. Dillencourt and W. D. Smith, A linear-time algorithm for testing the inscribability of trivalent polyhedra, International Journal of Computational Geometry & Applications, 5(1-2), March-June 1995, 21-36.