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
|
Text (Avgustinovich-etal-TCS2015-Gray-coding-cubic-planar-maps)
Avgustinovich_etal_TCS2015_Gray_coding_cubic_planar_maps.pdf Accepted Author Manuscript Download (305kB)| Preview |
Official URL: https://doi.org/10.1016/j.tcs.2015.12.013
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.
Creators(s): |
Avgustinovich, Sergey, Kitaev, Sergey ![]() | Item type: | Article |
---|---|
ID code: | 55318 |
Keywords: | planar map, bicubic planar map, cubic non-separable planar map, 3-connected cubic planar map, gray code, description tree , β(0,1)-tree, Electronic computers. Computer science, Theoretical Computer Science, Computer Science(all) |
Subjects: | Science > Mathematics > Electronic computers. Computer science |
Department: | Faculty of Science > Computer and Information Sciences |
Depositing user: | Pure Administrator |
Date deposited: | 13 Jan 2016 16:30 |
Last modified: | 25 Jan 2021 03:31 |
Related URLs: | |
URI: | https://strathprints.strath.ac.uk/id/eprint/55318 |
Export data: |
CORE (COnnecting REpositories)