Hostname: page-component-848d4c4894-wzw2p Total loading time: 0 Render date: 2024-05-07T09:36:23.937Z Has data issue: false hasContentIssue false

Planar maps with prescribed types of vertices and faces

Published online by Cambridge University Press:  26 February 2010

Branko Grünbaum
Affiliation:
University of Washington
Get access

Extract

For a 3-connected graph G imbedded in the plane let νk(G) denote the number of k-valent vertices, and let pk(G) denote the number of k-gonal faces (countries) of the map defined by G. (We consider only graphs without loops or multiple edges; hence, νk(G) and pk(G) are defined only for k ≥ 3.) It is a wellknown consequence of Euler's formula that

Type
Research Article
Copyright
Copyright © University College London 1969

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Barnette, D., “On p-vectors of simple 3-polytopes”, J. Combinat. Theory. (To appear.)Google Scholar
2.Böttger, G. and Harders, H., “Note on a problem by S. L. Hakimi concerning planar graphs without parallel elements”, Journal SIAM, 12 (1964), 838839.Google Scholar
3.Eberhard, V., Zur Morphologie der Polyeder (Teubner, Leipzig 1891).Google Scholar
4.Grünbaum, B., Convex polytopes (J. Wiley and Sons, New York 1967).Google Scholar
5.Grünbaum, B., “A companion to Eberhard's theorem”, Israel J. Math. (To appear.)Google Scholar
6.Grünbaum, B., “Polytopes, graphs, and complexes”, Bull. Amer. Math. Soc. (To appear.)Google Scholar
7.Rowland, D., An extension of Eberhard's theorem (M.Sc. Thesis, University of Washington 1968).Google Scholar
8.Steinitz, E., “Polyeder und Raumeinteilungen”, Enzykl. math. Wiss., Vol. 3 (Geometrie), Part 3 AB 12, 1139 (1922).Google Scholar
9.Steinitz, E. and Rademacher, H., Vorlesungen uber die Theorie der Polyeder (Springer, Berlin, 1934).Google Scholar