On the possibility of an Euler tour representation by Gray codes (Q2740487)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the possibility of an Euler tour representation by Gray codes |
scientific article; zbMATH DE number 1646958
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the possibility of an Euler tour representation by Gray codes |
scientific article; zbMATH DE number 1646958 |
Statements
24 October 2001
0 references
Euler tour
0 references
Gray code
0 references
Boolean cube
0 references
On the possibility of an Euler tour representation by Gray codes (English)
0 references
The existence of an Euler tour on a Boolean cube as a Gray code is discussed. It is shown that no Euler tour is the union of Hamilton cycles which are Gray codes. An algorithm for Euler tours with a linear space complexity is proposed.
0 references
0.805959165096283
0 references
0.7489399313926697
0 references
0.7484456896781921
0 references
0.7483012080192566
0 references