Counting symmetric and near-symmetric fullerene patches

DOI10.1007/S10910-014-0393-2zbMath1331.92168OpenAlexW1982506462MaRDI QIDQ488039

Christina Graves, Stephen J. Graves

Publication date: 23 January 2015

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

Full work available at URL: https://doi.org/10.1007/s10910-014-0393-2

zbMATH Keywords

fullerenenanoconeboundary codesfullerene patchpseudoconvex patch

Mathematics Subject Classification ID

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

Related Items (1)

Coronoids, patches and generalised altans

Cites Work

• Classification and generation of nanocones
• PentHex puzzles. A reliable and efficient top-down approach to fullerene-structure enumeration
• Finding Fullerene Patches in Polynomial Time
• Side lengths of pseudoconvex fullerene patches

This page was built for publication: Counting symmetric and near-symmetric fullerene patches