On a class of Hamiltonian polytopes

DOI10.1016/0012-365X(88)90103-3zbMath0655.05045MaRDI QIDQ1109049

Peter Mihók, Stanlislav Jendroľ

Publication date: 1988

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

zbMATH Keywords

3-connected 3-valent planar graphsHamiltonian polytopespoint- arboricity

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items

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 ⋮ Convex 3-polytopes with exactly two types of edges ⋮ Shortness coefficients of simple 3-polytopal graphs with edges of only two types ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On cubic polyhedral graphs with prescribed adjacency properties of their faces

Cites Work

• Unnamed Item
• On the simplicial 3-polytopes with only two types of edges
• Simple 3-polytopal graphs with edges of only two types and shortness coefficients
• Non-Hamiltonian simple 3-polytopes having just two types of faces
• Hamiltonian circuits in polytopes with even sided faces
• Regular planar graphs with faces of only two types and shortness parameters
• A class of Hamiltonian polytopes
• The Point-Arboricity of Planar Graphs
• $B$-sets and coloring problems

This page was built for publication: On a class of Hamiltonian polytopes