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 (https://doi.org/10.1016/j.tcs.2015.12.013)

Preview

Text. Filename: Avgustinovich_etal_TCS2015_Gray_coding_cubic_planar_maps.pdf Accepted Author Manuscript Download (305kB)| Preview

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.

ORCID iDs

Kitaev, Sergey ORCID: https://orcid.org/0000-0003-3324-1647

• Share and Export
  

  RDF+XMLBibTeXRIOXX2 XMLRDF+N-TriplesJSONDublin CoreAtomSimple MetadataReferMETSHTML CitationASCII CitationOpenURL ContextObjectEndNoteOpenURL ContextObject in SpanMODSMPEG-21 DIDLEP3 XMLData Cite XMLRIS (EndNote Online, Zotero, Ref manager, etc)RDF+N3Multiline CSV
• Citations and altmetrics
• Item metadata

  Item type:	Article
  ID code:	55318
  Dates:	Date Event 22 February 2016 Published 22 December 2015 Published Online 14 December 2015 Accepted
  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:	22 May 2023 03:30
  Related URLs:	http://www.sciencedirect.com/science/art...
  URI:	https://strathprints.strath.ac.uk/id/eprint/55318