Simple 3-polytopal graphs with edges of only two types and shortness coefficients

DOI10.1016/0012-365X(86)90074-9zbMath0586.05027OpenAlexW2035239952MaRDI QIDQ1071787

Peter J. Owens

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0012-365x(86)90074-9

zbMATH Keywords

shortness coefficientcyclically 4-edge connectednon-Hamltonian graphsplanar 3-connected graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Polyhedra and polytopes; regular figures, division of spaces (51M20) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (10)

A lower bound for the shortness coefficient of a class of graphs ⋮ Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters ⋮ On a class of Hamiltonian polytopes ⋮ Convex 3-polytopes with exactly two types of edges ⋮ Shortness coefficients of simple 3-polytopal graphs with edges of only two types ⋮ On quadrangular convex 3-polytopes with at most two types of edges ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On cubic polyhedral graphs with prescribed adjacency properties of their faces

Cites Work

• Non-Hamiltonian cubic planar maps
• On the simplicial 3-polytopes with only two types of edges
• Non-Hamiltonian simple 3-polytopes having just two types of faces
• Note on two problems of J. Zaks concerning Hamiltonian 3-polytopes
• Shortness parameters of families of regular planar graphs in two or three types of faces
• Pairs of edge-disjoint Hamiltonian circuits
• Shortness exponents of families of graphs
• Regular planar graphs with faces of only two types and shortness parameters
• Shortness parameters for planar graphs with faces of only one type
• Cyclically 5-edge-connected cubic planar graphs and shortness coefficients

This page was built for publication: Simple 3-polytopal graphs with edges of only two types and shortness coefficients