Rotation sequences and edge-colouring of binary tree pairs
From MaRDI portal
Publication:703564
DOI10.1016/J.TCS.2004.06.018zbMATH Open1053.05047OpenAlexW2008236174MaRDI QIDQ703564FDOQ703564
Authors: Paul Sant, A. 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
Recommendations
Cites Work
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- The four-colour theorem
- Every planar map is four colorable
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Title not available (Why is that?)
- A note on some tree similarity measures
- Guthrie's problem: new equivalences and rapid reductions
- Twist–Rotation Transformations of Binary Trees and Arithmetic Expressions
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- A metric for rooted trees with unlabeled vertices based on nested parentheses
- On the rotation distance between binary trees
- Refined upper bounds for right-arm rotation distances
- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order
- Problems on pairs of trees and the four colour problem of planar graphs (extended abstract)
- Toward a language theoretic proof of the four color theorem
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
This page was built for publication: Rotation sequences and edge-colouring of binary tree pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703564)
