On a problem of J. Zaks concerning 5-valent 3-connected planar graphs

DOI10.1016/0012-365X(84)90051-7zbMath0538.05032OpenAlexW2161194290MaRDI QIDQ793048

Stanlislav Jendroľ

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90051-7

zbMATH Keywords

planar graphEberhard-type problem

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

On face-vectors of 5-valent convex 3-polytopes

Cites Work

• An existence theorem for simple convex polyhedra
• Convex 4-valent polytopes
• Five-valent convex polyhedra with prescribed faces
• Strengthening of a theorem about 3-polytopes
• Über 3-realisierbare Folgen mit beliebigen Sechseckzahlen
• Extending two theorems of A. Kotzig
• Some analogues of Eberhard's theorem on convex polytopes
• On Face-Vectors and Vertex-Vectors of Cell-Decompositions of Orientable 2-Manifolds
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a problem of J. Zaks concerning 5-valent 3-connected planar graphs