Gray coding cubic planar maps | Sciact

Journal

Theoretical Computer Science
ISSN: 0304-3975

Output data

Year: 2015, Volume: 616, Pages: 59-69 Pages count : 11 DOI: 10.1016/j.tcs.2015.12.013

Tags

3-Connected cubic planar map; Bicubic planar map; Cubic non-separable planar map; Description tree; Gray code; Planar map; β(0, 1)-Tree

Authors

Avgustinovich Sergey ¹ , Kitaev Sergey ² , Potapov Vladimir N. ¹ , Vajnovszki Vincent ³

Affiliations

1	Sobolev Institute of Mathematics, 4 Acad. Koptyug Ave, 630090 Novosibirsk, Russia
2	Department of Computer and Information Sciences, University of Strathclyde, 26 Richmond Street, Glasgow G1 1XH, United Kingdom
3	E2I, Université de Bourgogne Franche-Comté, BP 47870, 21078 Dijon Cedex, France

Avgustinovich S. , Kitaev S. , Potapov V.N. , Vajnovszki V.
Gray coding cubic planar maps
Theoretical Computer Science. 2015. V.616. P.59-69. DOI: 10.1016/j.tcs.2015.12.013 WOS Scopus OpenAlex