Gray coding cubic planar maps

Sergey Avgustinovich, Sergey Kitaev, Vladimir Potapov, Vincent Vajnovszki

Research output: Contribution to journalArticle

18 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 languageEnglish
Pages (from-to)59-69
Number of pages11
JournalTheoretical Computer Science
Volume616
Early online date22 Dec 2015
DOIs
Publication statusPublished - 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

Fingerprint Dive into the research topics of 'Gray coding cubic planar maps'. Together they form a unique fingerprint.

  • Cite this