Pentagon-hexagon-patches with short boundaries

DOI10.1016/S0195-6698(03)00034-9zbMATH Open1022.05018OpenAlexW2083821991MaRDI QIDQ1399690FDOQ1399690

Authors: Jörn Bornhöft, Gunnar Brinkmann, J. Greinus 

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

Recommendations

• Patches with minimal boundary length
• Patches with short boundaries
• Side lengths of pseudoconvex fullerene patches
• Numbers of faces in disordered patches
• Fullerene patches I

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)

Cites Work

• Title not available (Why is that?)
• A constructive enumeration of nanotube caps

Cited In (15)

• Vertex isoperimetric parameter of a computation graph
• Fusenes and benzenoids with perfect matchings
• Distance based indices in nanotubical graphs. I
• Patches with short boundaries
• Patches with minimal boundary length
• Title not available (Why is that?)
• Counting hexagonal patches and independent sets in circle graphs
• Isoperimetrically optimal polygons in the triangular grid
• Classification and generation of nanocones
• Sizes of pentagonal clusters in fullerenes
• \(k\)-belts and edge-cycles of three-dimensional simple polytopes with at most hexagonal facets
• Recursive generation of IPR fullerenes
• The isolated-pentagon rule and nice substructures in fullerenes
• 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

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

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