Regular planar graphs with faces of only two types and shortness parameters

DOI10.1002/jgt.3190080207zbMath0541.05037MaRDI QIDQ3328572

Peter J. Owens

Publication date: 1984

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190080207

zbMATH Keywords

cyclic edge connectivity; shortness exponent; shortness coefficient

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C38: Paths and cycles

05C10: Planar graphs; geometric and topological aspects of graph theory

Related Items

Unnamed Item, Long cycles in fullerene graphs, Longest cycles in polyhedral graphs, Simple 3-polytopal graphs with edges of only two types and shortness coefficients, On a class of Hamiltonian polytopes, On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles, Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters, Longest cycles in generalized Buckminsterfullerene graphs, 5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one, A nonhamiltonian five-regular multitriangular polyhedral graph, Shortness coefficient of cyclically 4-edge-connected cubic graphs, Regular non-Hamiltonian polyhedral graphs, Unnamed Item

Cites Work

• Unnamed Item
• Non-Hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons
• Non-Hamiltonian Simple Planar Graphs