[1] DILLENCOURT M. B-SMITH W. D.: A linear time algorithm for testing the inscribability of trivalent polyhedra. Internat. J. Comput. Geom. Appl. 5 (1995), 21-36. MR 1331174

[2] DILLENCOURT M. B.-SMITH W. D.: A simple method for resolving degeneracies in Delaunay triangulations. In: Automata, Languages, and Programming: Proc. 20th Internal. Coll., Lund Sweden ICALP, Lund, Sweden, July 1993. Lecture Notes in Comput. Sci. 700, Springer, Berlin-New York, 1993, pp. 177-188. MR 1252411

[3] GRÜNBAUM B.: On Steinitz's theorem about non-inscribable polyhedra. Nederl. Akad. Wetensch. Proc. Ser. A 66 (1963), 452-455. MR 0152945 | Zbl 0115.15005

[4] GRÜNBAUM B.-SHEPHARD G. C.: Some problems on polyhedra. J. Geom. 29 (1987), 182-190. MR 0904573 | Zbl 0618.52004

[5] HARARY F.: Graph Theory. Addison Wesley, Reading, 1969. MR 0256911 | Zbl 0196.27202

[6] HODGSON C. D.-RIVIN I.-SMITH W. D.: A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere. Bull. Amer. Math. Soc. (N.S.) 27 (1992), 246-251. MR 1149872 | Zbl 0759.52010

[7] JUCOVIČ E.-ŠEVEC S.: Note on inscribability of quadrangular polyhedra with restricted number of edge-types. J. Geom. 42 (1991), 126-131. MR 1132841 | Zbl 0742.52011

[8] STEINER J.: Systematische Entwicklung der Abhängigkeit geometrischer Gestalten von einander. Reimer, Berlin, 1832; Jacob Steiner's Collected Works, Vol. 1, Berlin, 1881. Zbl 0015.36602

[9] STEINITZ E.: Uber isoperimetrische Probleme bei konvexen Polyedern I; II. J. Reine Angew. Math. 158; 159 (1927; 1929), 129-153; 133-143.