Reducing an arbitrary fullerene to the dodecahedron

DOI10.1016/j.disc.2016.07.006zbMath1369.05196OpenAlexW2518340620MaRDI QIDQ2401807

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) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cites Work

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

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