Rotation sequences and edge-colouring of binary tree pairs

DOI10.1016/j.tcs.2004.06.018zbMath1053.05047OpenAlexW2008236174MaRDI QIDQ703564

Paul Sant, Alan M. Gibbons

Publication date: 11 January 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.06.018

zbMATH Keywords

Binary treeRotationFour-colour problemGraph coloring

Mathematics Subject Classification ID

Trees (05C05) Combinatorics in computer science (68R05) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations ⋮ On the rotation distance between binary trees ⋮ Refined upper bounds for right-arm rotation distances ⋮ A metric for rooted trees with unlabeled vertices based on nested parentheses ⋮ A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order ⋮ Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Guthrie's problem: new equivalences and rapid reductions
• A note on some tree similarity measures
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• The four-colour theorem
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• Every planar map is four colorable
• Twist–Rotation Transformations of Binary Trees and Arithmetic Expressions

This page was built for publication: Rotation sequences and edge-colouring of binary tree pairs