PentHex puzzles. A reliable and efficient top-down approach to fullerene-structure enumeration
From MaRDI portal
Publication:1271874
DOI10.1006/aama.1998.0608zbMath0916.05067OpenAlexW176030193MaRDI QIDQ1271874
Gunnar Brinkmann, Andreas W. M. Dress
Publication date: 19 July 1999
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/aama.1998.0608
Applications of graph theory (05C90) Enumeration in graph theory (05C30) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Eulerian and Hamiltonian graphs (05C45)
Related Items
Z-oriented triangulations of surfaces ⋮ Face-spiral codes in cubic polyhedral graphs with face sizes no larger than 6 ⋮ Counting symmetric and near-symmetric fullerene patches ⋮ Cubic polyhedral Ramanujan graphs with face size no larger than six ⋮ \(Z\)-knotted and \(Z\)-homogeneous triangulations of surfaces
Cites Work
