首页 | 本学科首页   官方微博 | 高级检索  
     


Filling of a given boundary by p-gons and related problems
Authors:Mathieu Dutour Sikiri&#x  , Michel Deza,Mikhail Shtogrin
Affiliation:

aRudjer Bosković Institute, Croatia

bÉcole Normale Supérieure, Paris, France

cSteklov Mathematical Institute, Moscow, Russia

Abstract:We consider here (p,s)-polycycles (3less-than-or-equals, slantpless-than-or-equals, slants) i.e. plane graphs, such that all interior faces are p-gons, all interior vertices are s-valent and any vertex of the boundary (i.e. the exterior face) has valency within [2,s]. The boundary sequence of a (p,s)-polycycle P is the sequence b(P) enumerating, up to a cyclic shift or reversal, the consecutive valencies of vertices of the boundary. We show that the values p=3,4 are the only ones, such that the boundary sequence defines its (p,3)-filling (i.e. a (p,3)-polycycle with given boundary) uniquely.Also we give new results in the enumeration of maps Mn(p,q) (i.e. plane 3-valent maps with only p- and q-gonal faces, such that the q-gons are organized in an n-ring) and two of their generalizations.Both problems are similar (3-valent filling by p-gons of a boundary or of a ring of q-gons) and the same programs were used for both computations.
Keywords:Plane graphs   Boundary   Unicity   Enumeration
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号