6533b86dfe1ef96bd12cab33

RESEARCH PRODUCT

Gray coding cubic planar maps

Vincent VajnovszkiVladimir N. PotapovSergey AvgustinovichSergey Kitaev

subject

QA75[ INFO ] Computer Science [cs]General Computer SciencePlanar straight-line graph0102 computer and information sciences02 engineering and technologyComputer Science::Computational GeometryCubic non-separable planar map01 natural sciencesTheoretical Computer ScienceGray codeCombinatoricssymbols.namesakePlanarPlanar mapbeta(01)-Tree0202 electrical engineering electronic engineering information engineering[INFO]Computer Science [cs]Gray codeMathematicsDiscrete mathematicsBicubic planar map3-Connected cubic planar mapPlanar graph010201 computation theory & mathematicsDescription treesymbolsBicubic interpolation020201 artificial intelligence & image processingMathematicsofComputing_DISCRETEMATHEMATICS

description

International audience; 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. (C) 2015 Elsevier B.V. All rights reserved.

yearjournalcountryeditionlanguage
2016-02-22
10.1016/j.tcs.2015.12.013https://strathprints.strath.ac.uk/55318/1/Avgustinovich_etal_TCS2015_Gray_coding_cubic_planar_maps.pdf