Reducing an arbitrary fullerene to the dodecahedron

DOI10.1016/J.DISC.2016.07.006MaRDI QIDQ2401807zbMATHOpenAlexFDO

Authors Herbert Fleischner

Publication date 5 September 2017

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2016.07.006

zbMATH Keywords

planar graphsfullerenesfullerene graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• The Fedorov algorithm revised
• Construction of fullerenes with the number of hexagons no more than 7
• PentHex puzzles. A reliable and efficient top-down approach to fullerene-structure enumeration
• scientific article; zbMATH DE number 1522752
• Fullerene patches I

Cites work

• Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
• Graph theory
• Recursive generation of IPR fullerenes
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra

Cited in

(2)

• The Fedorov algorithm revised
• Recursive generation of IPR fullerenes

This page was built for publication: Reducing an arbitrary fullerene to the dodecahedron

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