The rotation graph of \(k\)-ary trees is Hamiltonian

DOI10.1016/j.ipl.2008.09.013zbMath1191.68450OpenAlexW2129986455WikidataQ61732488 ScholiaQ61732488MaRDI QIDQ975545

Ferran Hurtado, Julian Pfeifle, Clemens Huemer

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.09.013

zbMATH Keywords

combinatorial problems\(k\)-ary treesgray codepolygon dissections

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Dissections, Hom-complexes and the Cayley trick
• Loopless generation of \(k\)-ary tree sequences
• Polygon dissections and Euler, Fuss, Kirkman, and Cayley numbers
• On generating \(k\)-ary trees in computer representation
• Loopless generation of Gray codes for \(k\)-ary trees
• The associahedron and triangulations of the \(n\)-gon
• Graph of triangulations of a convex polygon and tree of triangulations
• Polygon dissections and some generalizations of cluster complexes
• The rotation graph of binary trees is Hamiltonian
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• Lectures on Polytopes
• A Survey of Combinatorial Gray Codes
• A Loopless Gray-Code Algorithm for Listing k-ary Trees
• Unnamed Item
• Unnamed Item