Abstract
The existence of unambiguousd-polyhedral graphs is established for everyd.
Similar content being viewed by others
References
Gale, D., 1964, Neighborly and cyclic polytopes,Proc. Symp. Pure Math.,7, 225–232.
Gale, D., 1964, On a number of faces of a convex polytope.Canad. J. Math.,16, 12–17.
Grünbaum, B. and Motzkin, T. S., 1963, On polyhedral graphs,Proc. Symp. Pure Math.,7, 285–290.
Klee, V., 1963, On the number of vertices of a convex polytope, Math. Note No. 304. Boeing Sci. Res. Labs., June, 1963 (42 pages); to appear in theCanadian J. Math.
Klee, V., A property ofd-polyhedral graphs, Math. Note No. 319. Boeing Sci. Res. Labs., August, 1963 (7 pages); to appear in theJ. Math. and Mech.
Weyl, H., 1934/35, Elementare Theorie der konvexen Polyeder,Comm. Math. Helv. 7, 290–306.
Author information
Authors and Affiliations
Additional information
Research supported in part by the National Science Foundation, U. S. A. (NSF-GP-378).
Rights and permissions
About this article
Cite this article
Grünbaum, B. Unambiguous polyhedral graphs. Israel J. Math. 1, 235–238 (1963). https://doi.org/10.1007/BF02759726
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02759726