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

DOI10.1002/jgt.3190080207zbMath0541.05037OpenAlexW2025088053MaRDI 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 connectivityshortness exponentshortness coefficient

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (13)

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

Cites Work

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

This page was built for publication: Regular planar graphs with faces of only two types and shortness parameters