The rotation graph of binary trees is Hamiltonian

DOI10.1016/0196-6774(87)90048-4zbMath0641.05015OpenAlexW1989190970MaRDI QIDQ3781770

Joan M. Lucas

Publication date: 1987

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(87)90048-4

zbMATH Keywords

Hamiltonian cyclefast algorithmbinary treesrotation graph

Mathematics Subject Classification ID

Trees (05C05) Eulerian and Hamiltonian graphs (05C45)

Related Items (19)

A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations ⋮ On the loopless generation of binary tree sequences ⋮ Ranking trees generated by rotations ⋮ On the rotation distance between binary trees ⋮ Loop Free Generation ofK-Ary Trees ⋮ A direct algorithm for restricted rotation distance ⋮ An efficient algorithm for estimating rotation distance between two binary trees ⋮ Celebrating Loday's associahedron ⋮ Rotation distance for rank bounded trees ⋮ A loopless algorithm for generating binary tree sequences ⋮ Flips in planar graphs ⋮ The rotation graph of \(k\)-ary trees is Hamiltonian ⋮ Once punctured disks, non-convex polygons, and pointihedra ⋮ Rainbow Cycles in Flip Graphs ⋮ Combinatorial generation via permutation languages. II. Lattice congruences ⋮ A constant-time algorithm for middle levels Gray codes ⋮ Gray codes for non-crossing partitions and dissections of a convex polygon ⋮ An improved kernel size for rotation distance in binary trees ⋮ Rainbow Cycles in Flip Graphs.

This page was built for publication: The rotation graph of binary trees is Hamiltonian