Gray coding cubic planar maps - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2016

Gray coding cubic planar maps


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. (C) 2015 Elsevier B.V. All rights reserved.

Dates et versions

hal-01431171 , version 1 (10-01-2017)



Sergey Avgustinovich, Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki. Gray coding cubic planar maps. Theoretical Computer Science, 2016, 616, pp.59 - 69. ⟨10.1016/j.tcs.2015.12.013⟩. ⟨hal-01431171⟩
29 Consultations
0 Téléchargements



Gmail Facebook Twitter LinkedIn More