Pentagon-hexagon-patches with short boundaries

DOI10.1016/S0195-6698(03)00034-9zbMath1022.05018OpenAlexW2083821991MaRDI QIDQ1399690

Juliane Greinus, Jörn Bornhöft, Gunnar Brinkmann

Publication date: 30 July 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(03)00034-9

zbMATH Keywords

faceplane graphpentagon-hexagon-patch

Mathematics Subject Classification ID

Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (12)

Sizes of pentagonal clusters in fullerenes ⋮ Counting hexagonal patches and independent sets in circle graphs ⋮ Classification and generation of nanocones ⋮ The isolated-pentagon rule and nice substructures in fullerenes ⋮ Distance based indices in nanotubical graphs. I ⋮ Isoperimetrically Optimal Polygons in the Triangular Grid ⋮ Recursive generation of IPR fullerenes ⋮ VERTEX ISOPERIMETRIC PARAMETER OF A COMPUTATION GRAPH ⋮ Fusenes and benzenoids with perfect matchings ⋮ Patches with short boundaries ⋮ Isoperimetrically optimal polygons in the triangular grid with Jordan-type neighbourhood on the boundary ⋮ Constructions of families of three-dimensional polytopes, characteristic patches of fullerenes, and Pogorelov polytopes

Uses Software

• CaGe

Cites Work

• A constructive enumeration of nanotube caps
• Unnamed Item

This page was built for publication: Pentagon-hexagon-patches with short boundaries