The analogue of Eberhard's theorem for 4-valent graphs on the torus

DOI10.1007/BF02771680zbMath0222.05103MaRDI QIDQ2547563

Joseph Zaks

Publication date: 1971

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Realizations with a cut-through Eulerian circuit, Unnamed Item, Polytopes, graphs, and complexes, An Eberhard-like theorem for pentagons and heptagons, There is no triangulation of the torus with vertex degrees \(5, 6, \dots , 6, 7\) and related results: geometric proofs for combinatorial theorems, 6-valent analogues of Eberhard's theorem, A theorem on the structure of cell–decompositions of orientable 2–manifolds, Graph theory, An existence theorem for simple convex polyhedra, On realizing symmetric 3-polytopes, The toroidal analogue to Eberhard's theorem

Cites Work

• Unnamed Item
• Some analogues of Eberhard's theorem on convex polytopes
• Planar maps with prescribed types of vertices and faces