Name
Abstract | ||
|---|---|---|
In this paper we show that the graph of k-ary trees, connected by rotations, contains a Hamilton cycle. Our proof is constructive and thus provides a cyclic Gray code for k-ary trees. Furthermore, we identify a basic building block of this graph as the 1-skeleton of the polytopal complex dual to the lower faces of a certain cyclic polytope. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.ipl.2008.09.013 | Information Processing Letters |
Keywords | DocType | Volume |
Combinatorial problems,Gray code,k-ary trees,Polygon dissections | Journal | 109 |
Issue | ISSN | Citations |
2 | 0020-0190 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Clemens Huemer | 1 | 167 | 24.93 |
| Ferran Hurtado | 2 | 744 | 86.37 |
| Julian Pfeifle | 3 | 31 | 6.56 |