Gray coding cubic planar maps

详细信息    查看全文

• 作者：Sergey Avgustinovich^a ; ^{avgust@math.nsc.ru" class="auth_mail" title="E-mail the corresponding author} ; Sergey Kitaev^b ; ^{sergey.kitaev@strath.ac.uk" class="auth_mail" title="E-mail the corresponding author} ; Vladimir N. Potapov^a ; ^{vpotapov@math.nsc.ru" class="auth_mail" title="E-mail the corresponding author} ; Vincent Vajnovszki^c ; ^{vvajnov@u-bourgogne.fr" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Planar map ; Bicubic planar map ; Cubic non-separable planar map ; 3-Connected cubic planar map ; Gray code ; Description tree ; β(0 ; 1)β(0 ; 1)-Tree
• 刊名：Theoretical Computer Science
• 出版年：2016
• 出版时间：22 February 2016
• 年：2016
• 卷：616
• 期：Complete
• 页码：59-69
• 全文大小：446 K

文摘

The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, we utilize β-description trees to cyclicly Gray code three classes of cubic planar maps, namely, bicubic planar maps, 3-connected cubic planar maps, and cubic non-separable planar maps.