Realizations with a cut-through Eulerian circuit

DOI10.1016/0012-365X(93)E0129-RzbMath0877.05033MaRDI QIDQ1343790

Dal-Young Jeong

Publication date: 6 February 1995

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

zbMATH Keywords

facesEuler formulaEulerian circuitcut-through EulerianEberhard problemEberhard's theoremGrünbaum's theorem

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

The link component number of suspended trees ⋮ Cubic inflation, mirror graphs, regular maps, and partial cubes ⋮ Complementary regions of knot and link diagrams ⋮ Straight-ahead walks in Eulerian graphs

Cites Work

• The Gauss code problem off the plane
• 6-valent analogues of Eberhard's theorem
• Some analogues of Eberhard's theorem on convex polytopes
• The analogue of Eberhard's theorem for 4-valent graphs on the torus
• On realizing symmetric 3-polytopes
• On p-vectors of 3-polytopes
• Planar maps with prescribed types of vertices and faces
• Properties of planar graphs with uniform vertex and face structure.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Realizations with a cut-through Eulerian circuit