Gray coding cubic planar maps
From MaRDI portal
Publication:906395
DOI10.1016/j.tcs.2015.12.013zbMath1334.94104arXiv1509.05807OpenAlexW2207947455MaRDI QIDQ906395
Sergey Kitaev, Vicentiu Vajnovszki, Vladimir N. Potapov, Sergei V. Avgustinovich
Publication date: 21 January 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.05807
Gray codeplanar map\(\beta(0, 1)\)-tree3-connected cubic planar mapbicubic planar mapcubic non-separable planar mapdescription tree
Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial codes (94B25)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatorial Gray codes for classes of pattern avoiding permutations
- On the hamiltonicity of the Cartesian product
- Description trees and Tutte formulas.
- Generating a Gray code for P-sequences
- Generating binary trees by transpositions
- A Survey of Combinatorial Gray Codes
- An involution on bicubic maps and \beta(0,1)-trees
- A Census of Planar Maps
This page was built for publication: Gray coding cubic planar maps