Gray coding cubic planar maps

Article English OPEN
Avgustinovich , Sergey; Kitaev , Sergey; Potapov , Vladimir N.; Vajnovszki , Vincent;
  • Publisher: Elsevier
  • Related identifiers: doi: 10.1016/j.tcs.2015.12.013
  • Subject: Description tree | [ INFO ] Computer Science [cs] | Cubic non-separable planar map | beta(0 | Planar map | 3-Connected cubic planar map | 1)-Tree | Bicubic planar map | Gray code
    acm: MathematicsofComputing_DISCRETEMATHEMATICS

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 ... View more
Share - Bookmark