| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437491 | Theoretical Computer Science | 2016 | 11 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Sergey Avgustinovich, Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki,