The edge rotation graph

DOI10.1007/s00373-012-1201-zzbMath1272.05165OpenAlexW2019103912WikidataQ61732477 ScholiaQ61732477MaRDI QIDQ367068

Clemens Huemer, Javier Cano, Jorge Urrutia, José-Miguel Díaz-Báñez

Publication date: 26 September 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1201-z

zbMATH Keywords

rotationdiametergeometric graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Connectivity (05C40)

Related Items (3)

A proof of the orbit conjecture for flipping edge-labelled triangulations ⋮ Flipping edge-labelled triangulations ⋮ Transition operations over plane trees

Cites Work

• Unnamed Item
• An improved kernel size for rotation distance in binary trees
• A quadratic distance bound on sliding between crossing-free spanning trees
• Flips in planar graphs
• Distances between graphs under edge operations
• On the chromatic number of tree graphs
• An efficient upper bound of the rotation distance of binary trees
• Flipping edges in triangulations
• Transforming triangulations

This page was built for publication: The edge rotation graph