On cubic polyhedral graphs with prescribed adjacency properties of their faces

DOI10.1016/S0012-365X(98)00107-1zbMath0958.05078MaRDI QIDQ1584409

Peter Smutný, Michal Tkáč

Publication date: 2 November 2000

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

zbMATH Keywords

facesnon-Hamiltonianshortness coefficientcubic polyhedral graphs

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-Hamiltonian cubic planar maps
• On the simplicial 3-polytopes with only two types of edges
• Simple 3-polytopal graphs with edges of only two types and shortness coefficients
• On a class of Hamiltonian polytopes
• Shortness coefficients of simple 3-polytopal graphs with edges of only two types
• The existence of certain planar maps
• Hamiltonian circuits in polytopes with even sided faces
• Pairs of edge-disjoint Hamiltonian circuits
• A lower bound for the shortness coefficient of a class of graphs
• Shortness exponents of families of graphs
• A class of Hamiltonian polytopes
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra

This page was built for publication: On cubic polyhedral graphs with prescribed adjacency properties of their faces