Gray coding cubic planar maps

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.

• Type: Journal
• Year: 2016
• Where: TCS
• Authors: Sergey V. Avgustinovich, Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki
• Keywords: TCS 2016, Theoretical Computer Science