Gray coding planar maps
Discrete Mathematics
2015-09-22 v1 Combinatorics
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.
Keywords
Cite
@article{arxiv.1509.05807,
title = {Gray coding planar maps},
author = {Sergey Avgustinovich and Sergey Kitaev and Vladimir N. Potapov and Vincent Vajnovszki},
journal= {arXiv preprint arXiv:1509.05807},
year = {2015}
}