论文信息 - 6-Valent analogues of Eberhard’s theorem

6-Valent analogues of Eberhard’s theorem

It is shown that for every sequence of non-negative integers (pn|1≦n≠3) satisfying the equation {ie19-1} (respectively, =0) there exists a 6-valent, planar (toroidal, respectively) multi-graph that has preciselypnn gonal faces for alln, 1≦n≠3. This extends Eberhard’s theorem that deals, in a similar fashion, with 3-valent, 3-connected planar graphs; the equation involved follows from the famous Euler’s equation.

Joseph Zaks | J. Zaks

[1] Metrically homogeneous sets , 1968 .

[2] D. Barnette,et al. Toroidal maps with prescribed types of vertices and faces , 1971 .

[3] Branko Grünbaum,et al. Some analogues of eberhard’s theorem on convex polytopes , 1968 .

[4] Joseph Zaks,et al. The analogue of eberhard’s theorem for 4-valent graphs on the torus , 1971 .

[5] Joseph Malkevitch,et al. Properties of planar graphs with uniform vertex and face structure , 1970 .

[6] S. Jendrol’,et al. On the Toroidal Analogue of Eberhard's Theorem , 1972 .

[7] Branko Grünbaum,et al. The existence of certain planar maps , 1974, Discret. Math..

[8] V. Eberhard. Zur Morphologie der Polyeder , 1891 .

[9] B. Grünbaum. Polytopes, graphs, and complexes , 1970 .

[10] O. Ore. The Four-Color Problem , 1967 .

[11] Branko Grünbaum,et al. Planar maps with prescribed types of vertices and faces , 1969 .