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 (https://doi.org/10.1016/j.tcs.2015.12.013)

[thumbnail of Avgustinovich-etal-TCS2015-Gray-coding-cubic-planar-maps]
Preview
 Text. Filename: Avgustinovich_etal_TCS2015_Gray_coding_cubic_planar_maps.pdf
Accepted Author Manuscript
Download (305kB)| Preview

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 $\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: https://orcid.org/0000-0003-3324-1647, Potapov, Vladimir and Vajnovszki, Vincent;
CORE (COnnecting REpositories)