Gray coding cubic planar maps

Avgustinovich, Sergey and Kitaev, Sergey and Potapov, Vladimir and Vajnovszki, Vincent (2016) Gray coding cubic planar maps. Theoretical Computer Science, 616. pp. 59-69. ISSN 0304-3975

[thumbnail of Avgustinovich-etal-TCS2015-Gray-coding-cubic-planar-maps]
Text (Avgustinovich-etal-TCS2015-Gray-coding-cubic-planar-maps)
Accepted Author Manuscript

Download (305kB)| Preview


    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 $\beta$-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.

    ORCID iDs

    Avgustinovich, Sergey, Kitaev, Sergey ORCID logoORCID:, Potapov, Vladimir and Vajnovszki, Vincent;