Primitive polycycles and helicenes
A planar graph \(G\) together with all its interior faces is called a primitive poly-\(r\)-cycle and denoted by \({\mathbf\Pi}(G)\) if the following three conditions hold: (1) the boundary of the exterior of \(G,\) coinciding with the boundary of \({\mathbf\Pi}(G)\), is a simple cycle; (2) all interior faces are bounded by simple cycles of the same length \(r\); (3) the intersection of any two interior faces is either a single edge or empty. It is shown that if a graph \(G\) admits a realization by a polycycle \({\mathbf\Pi}(G)\) as the finite part of a planar map satisfying (1)--(3), then all such realizations are isomorphic. It is a uniqueness theorem, since up to isomorphism any planar graph \(G\) can admit only one realization by a poly-\(r\)-cycle \({\mathbf\Pi}(G)\).
This page was built for publication: Primitive polycycles and helicenes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4515813)
