×

zbMATH — the first resource for mathematics

On quadrangular convex 3-polytopes with at most two types of edges. (English) Zbl 0691.52004
Let M be a convex 3-polytope with quadrangular faces, and suppose that each edge of M has its vertices either a- and b-valent, or b- and c- valent, where \(a\leq c\); the isomorphism class of such polytopes is denoted \({\mathcal S}(a,b,c)\). The authors completely determine which such classes \({\mathcal S}(a,b,c)\) are non-empty, and also find which of them are finite. The exact details are not reproduced here.
Reviewer: P.McMullen

MSC:
52Bxx Polytopes and polyhedra
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Grünbaum, B., Convex polytopes, (1967), Interscience London · Zbl 0163.16603
[2] Grünbaum, B.; Motzkin, T.S., The number of hexagons and the simplicity of geodesics on certain polyńedra, Canad. J. math., 19, 744-751, (1963) · Zbl 0121.37605
[3] Grünbaum, B.; Zaks, J., The existence of certain planar maps, Discrete math., 10, 93-115, (1974) · Zbl 0298.05112
[4] Jendrol’, S.; Tkác˛, M., On the simplical 3-polytopes with only two types of edges, Discrete math., 48, 229-241, (1984) · Zbl 0536.52003
[5] Jucovič, E., Convex 3-polytopes, (1981), Veda Bratislava, (in Slovak). · Zbl 0297.52006
[6] Kotzig, A., From the theory of Eulerian polyhedra, Mat. fyz.časopis SAV, 13, 20-31, (1963), (in Russian, English Summary). · Zbl 0134.19601
[7] Ore, O., The four-color problem, () · Zbl 0149.21101
[8] Owens, P.J., Non-Hamiltonian simple 3-polytopes with only one type of face besides triangles, Annals of discrete math., 20, 241-251, (1984) · Zbl 0571.05033
[9] Owens, P.J., Simple 3-polytopal graphs with edges of only two types and shortness coefficients, Discrete math., 59, 107-114, (1986) · Zbl 0586.05027
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.