Face-spiral codes in cubic polyhedral graphs with face sizes no larger than 6
From MaRDI portal
Publication:1930473
DOI10.1007/s10910-012-0029-3zbMath1307.52007OpenAlexW2085973746MaRDI QIDQ1930473
Mohammadreza Jooyandeh, Gunnar Brinkmann, Patrick W. Fowler
Publication date: 11 January 2013
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-012-0029-3
Applications of graph theory (05C90) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Uses Software
Cites Work
- Tetrahedral fulleroids
- PentHex puzzles. A reliable and efficient top-down approach to fullerene-structure enumeration
- The construction of cubic and quartic planar maps with prescribed face degrees
- The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Face-spiral codes in cubic polyhedral graphs with face sizes no larger than 6