On cubic polyhedral graphs with prescribed adjacency properties of their faces
From MaRDI portal
Publication:1584409
DOI10.1016/S0012-365X(98)00107-1zbMATH Open0958.05078MaRDI QIDQ1584409FDOQ1584409
Authors: Peter Smutný, Michal Tkáč 
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Non-hamiltonian polyhedral graphs with two types of faces
- Simple 3-polytopal graphs with edges of only two types and shortness coefficients
- 5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one
- Non-Hamiltonian bicubic graphs
- Nonhamiltonian 3-Connected Cubic Planar Graphs
Three-dimensional polytopes (52B10) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)
Cites Work
- Graph theory
- Hamiltonian circuits in polytopes with even sided faces
- A class of Hamiltonian polytopes
- The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
- Pairs of edge-disjoint Hamiltonian circuits
- Shortness exponents of families of graphs
- Simple 3-polytopal graphs with edges of only two types and shortness coefficients
- The existence of certain planar maps
- Title not available (Why is that?)
- On the simplicial 3-polytopes with only two types of edges
- Non-Hamiltonian cubic planar maps
- Shortness coefficients of simple 3-polytopal graphs with edges of only two types
- Title not available (Why is that?)
- On a class of Hamiltonian polytopes
- A lower bound for the shortness coefficient of a class of graphs
Cited In (4)
This page was built for publication: On cubic polyhedral graphs with prescribed adjacency properties of their faces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584409)
