Counting symmetric and near-symmetric fullerene patches

DOI10.1007/S10910-014-0393-2MaRDI QIDQ488039zbMATH OpenOpenAlexFDO

Authors 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

nanoconefullereneboundary codesfullerene patchpseudoconvex patch

Mathematics Subject Classification ID

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

Recommendations

• Finding fullerene patches in polynomial time
• Fullerene patches. II
• Fullerene patches I
• scientific article; zbMATH DE number 1246215
• PentHex puzzles. A reliable and efficient top-down approach to fullerene-structure enumeration

Cites work

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

Cited in

(4)

• Symmetry-extended counting rules for periodic frameworks
• Coronoids, patches and generalised altans
• Fullerene patches. II
• Finding fullerene patches in polynomial time

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

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