Filling of a given boundary by \(p\)-gons and related problems

DOI10.1016/j.dam.2006.11.020zbMath1144.05026OpenAlexW2056870997MaRDI QIDQ947097

Mikhail Shtogrin, Mathieu Dutour Sikirić, Michel Marie Deza

Publication date: 29 September 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.11.020

zbMATH Keywords

enumerationunicityboundaryplane graphs

Mathematics Subject Classification ID

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

Related Items (2)

Counting hexagonal patches and independent sets in circle graphs ⋮ Fullerenes and disk-fullerenes

Uses Software

• GAP
• CaGe

Cites Work

• Clusters of cycles
• Zigzag Structures of Simple Two-Faced Polyhedra
• A constructive enumeration of fusenes and benzenoids
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Filling of a given boundary by \(p\)-gons and related problems