Longest cycles in generalized Buckminsterfullerene graphs

DOI10.1007/BF01166604MaRDI QIDQ1360640zbMATH OpenOpenAlexFDO

Authors Stanislav Jendroľ, Peter J. Owens

Publication date 20 October 1997

Published in Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01166604

zbMATH Keywords

cyclepolyhedral graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cites work

• A class of Hamiltonian polytopes
• Hamiltonian circuits in polytopes with even sided faces
• Non-Hamiltonian simple 3-polytopes having just two types of faces
• Note on two problems of J. Zaks concerning Hamiltonian 3-polytopes
• On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles
• On shortness exponents of families of graphs
• Regular planar graphs with faces of only two types and shortness parameters

Cited in

(8)

• Polyhedral graphs without Hamiltonian cycles
• scientific article; zbMATH DE number 86102 (Why is no real title available?)
• Hamiltonian cycles in some family of cubic 3-connected plane graphs
• Zigzag Structures of Simple Two-Faced Polyhedra
• Hamiltonicity of cubic planar graphs with bounded face sizes
• A computer-assisted proof of the Barnette-Goodey conjecture: not only fullerene graphs are Hamiltonian
• Long cycles in fullerene graphs
• Long cycles in fullerene graphs

This page was built for publication: Longest cycles in generalized Buckminsterfullerene graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1360640)