Gray coding cubic planar maps

Sergey Avgustinovich; Sergey Kitaev; Vladimir Potapov; Vincent Vajnovszki

doi:10.1016/j.tcs.2015.12.013

Gray coding cubic planar maps

Sergey Avgustinovich, Sergey Kitaev, Vladimir Potapov, Vincent Vajnovszki

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

40 Downloads (Pure)

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.

Original language	English
Pages (from-to)	59-69
Number of pages	11
Journal	Theoretical Computer Science
Volume	616
Early online date	22 Dec 2015
DOIs	https://doi.org/10.1016/j.tcs.2015.12.013
Publication status	Published - 22 Feb 2016

Keywords

planar map
bicubic planar map
cubic non-separable planar map
3-connected cubic planar map
gray code
description tree
β(0,1)-tree

Access to Document

10.1016/j.tcs.2015.12.013

Avgustinovich-etal-TCS2015-Gray-coding-cubic-planar-mapsAccepted author manuscript, 298 KB

Cite this

@article{025fb5854d8c4e98a5a902e60e92f9bf,

title = "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 objectsdiffer 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 = "planar map, bicubic planar map, cubic non-separable planar map, 3-connected cubic planar map, gray code, description tree , β(0,1)-tree",

author = "Sergey Avgustinovich and Sergey Kitaev and Vladimir Potapov and Vincent Vajnovszki",

year = "2016",

month = feb,

day = "22",

doi = "10.1016/j.tcs.2015.12.013",

language = "English",

volume = "616",

pages = "59--69",

journal = "Theoretical Computer Science",

issn = "0304-3975",

}

TY - JOUR

T1 - Gray coding cubic planar maps

AU - Avgustinovich, Sergey

AU - Kitaev, Sergey

AU - Potapov, Vladimir

AU - Vajnovszki, Vincent

PY - 2016/2/22

Y1 - 2016/2/22

N2 - The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objectsdiffer 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.

AB - The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objectsdiffer 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.

KW - planar map

KW - bicubic planar map

KW - cubic non-separable planar map

KW - 3-connected cubic planar map

KW - gray code

KW - description tree

KW - β(0,1)-tree

UR - http://www.sciencedirect.com/science/article/pii/S0304397515011743

U2 - 10.1016/j.tcs.2015.12.013

DO - 10.1016/j.tcs.2015.12.013

M3 - Article

SN - 0304-3975

VL - 616

SP - 59

EP - 69

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

Gray coding cubic planar maps

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Sergey Kitaev

Cite this

Gray coding cubic planar maps

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Profiles

Sergey Kitaev

Cite this