Pacific Journal of Mathematics

Simple paths on convex polyhedra.

Thomas A. Brown

Article information

Source
Pacific J. Math., Volume 11, Number 4 (1961), 1211-1214.

Dates
First available in Project Euclid: 14 December 2004

Permanent link to this document
https://projecteuclid.org/euclid.pjm/1103036906

Mathematical Reviews number (MathSciNet)
MR0140444

Zentralblatt MATH identifier
0106.16801

Subjects
Primary: 05.50
Secondary: 52.10

Citation

Brown, Thomas A. Simple paths on convex polyhedra. Pacific J. Math. 11 (1961), no. 4, 1211--1214. https://projecteuclid.org/euclid.pjm/1103036906


Export citation

References

  • [1] Michel L. Balinski, An Algorithm for FindingAllVertices of Convex Polyhedral Sets, Doctoral Dissertation, Princeton University, June 1959.
  • [2] Michel L. Balinski, On the graph structure of convex polyhedra in n-space. Pacific J. Math., (to appear).
  • [3] T. A. Brown, Hamiltonian Paths on Convex Polyhedra, unpublished note, the RAND Corporation, August, 1960.
  • [4] T. A. Brown, The Representation of Planar Graphs by Convex Polyhedra, unpublished note, the RAND Corporation, August, 1960.
  • [5] B. Griinbaum, and T. S. Motzkin, Longest Simple Paths in Polyhedral Graphs, (to appear).
  • [6] E. Steinitz, and H. Rademacher, Vorlesungen ber die Theorie des Polyeder, Springer, Berlin. 1934.