The rotation graph of binary trees is Hamiltonian

DOI10.1016/0196-6774(87)90048-4MaRDI QIDQ3781770zbMATH OpenOpenAlexFDO

Authors 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

binary treesfast algorithmHamiltonian cyclerotation graph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4055654
• On Rotations and the Generation of Binary Trees
• A New Algorithm for Generating Binary Trees using Rotations
• The rotation graph of \(k\)-ary trees is Hamiltonian
• scientific article; zbMATH DE number 1185291

Cited in

(29)

• Gray codes for non-crossing partitions and dissections of a convex polygon
• A loopless algorithm for generating binary tree sequences
• Once punctured disks, non-convex polygons, and pointihedra
• Combinatorial generation via permutation languages. II. Lattice congruences
• A constant-time algorithm for middle levels Gray codes
• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
• A direct algorithm for restricted rotation distance
• On the loopless generation of binary tree sequences
• Hamilton cycles in restricted rotator graphs
• Hamilton cycles in restricted and incomplete rotator graphs
• scientific article; zbMATH DE number 4055654 (Why is no real title available?)
• scientific article; zbMATH DE number 1185291 (Why is no real title available?)
• On Rotations and the Generation of Binary Trees
• Loop Free Generation ofK-Ary Trees
• Ranking trees generated by rotations
• Rainbow cycles in flip graphs
• Rainbow cycles in flip graphs
• An efficient algorithm for estimating rotation distance between two binary trees
• Celebrating Loday's associahedron
• Rotation distance for rank bounded trees
• On rotation distance of rank bounded trees
• A Gray code of ordered trees
• Acyclic reorientation lattices and their lattice quotients
• Visualizing Lucas's Hamiltonian paths through the associahedron 1-skeleton (media exposition)
• Flips in colorful triangulations
• An improved kernel size for rotation distance in binary trees
• On the rotation distance between binary trees
• Flips in planar graphs
• The rotation graph of \(k\)-ary trees is Hamiltonian

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3781770)