Elementary elliptic $(R,q)$-polycycles
Combinatorics
2007-05-23 v1
Abstract
We consider the following generalization of the decomposition theorem for polycycles. A {\em -polycycle} is, roughly, a plane graph, whose faces, besides some disjoint {\em holes}, are -gons, , and whose vertices, outside of holes, are -valent. Such polycycle is called {\em elliptic}, {\em parabolic} or {\em hyperbolic} if (where ) is positive, zero or negative, respectively. An edge on the boundary of a hole in such polycycle is called {\em open} if both its end-vertices have degree less than . We enumerate all elliptic {\em elementary} polycycles, i.e. those that any elliptic -polycycle can be obtained from them by agglomeration along some open edges.
Keywords
Cite
@article{arxiv.math/0507562,
title = {Elementary elliptic $(R,q)$-polycycles},
author = {Michel Deza and Mathieu Dutour and Mikhail Shtogrin},
journal= {arXiv preprint arXiv:math/0507562},
year = {2007}
}