Arc diagrams, flip distances, and Hamiltonian triangulations
type: Item
instance of: scholarly article
title: Arc diagrams, flip distances, and Hamiltonian triangulations
zbMATH Open document ID: 1380.05033
author: Peng Zhang
published in: Computational Geometry
publication date: 2018-02-19T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2015/4914/
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 6840487
zbMATH Keywords: maximal planar graphs
zbMATH Keywords: flip graphs
zbMATH Keywords: Hamiltonian graphs
zbMATH Keywords: book embeddings
zbMATH Keywords: graph diameter
MaRDI profile type: Publication
OpenAlex ID: W2624596731
cites work: Arc Diagrams, Flip Distances, and Hamiltonian Triangulations
cites work: THE MINIMUM NUMBER OF INTERSECTIONS IN COMPLETE GRAPHS
cites work: Shellable drawings and the cylindrical crossing number of \(K_n\)
cites work: Q5543311
cites work: Universal Point Sets for Drawing Planar Graphs with Circular Arcs
cites work: The book thickness of a graph
cites work: Embedding planar graphs at fixed vertex locations
cites work: Curve-constrained drawings of planar graphs
cites work: Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
cites work: Flips in planar graphs
cites work: A History of Flips in Combinatorial Triangulations
cites work: The diameter of associahedra
cites work: Rotation Distance, Triangulations, and Hyperbolic Geometry
cites work: Simultaneous diagonal flips in plane triangulations
cites work: Making triangulations 4-connected using flips
cites work: Q4434671
cites work: Triangulations without pointed spanning trees
cites work: Diagonal flips in Hamiltonian triangulations on the sphere
cites work: A Theorem on Planar Graphs
cites work: How to draw a planar graph on a grid
cites work: A linear-time algorithm for drawing a planar graph on a grid
cites work: Q5422499
cites work: Arboricity and Subgraph Listing Algorithms
cites work: The four-colour theorem
cites work: Q4351464
cites work: Separating 3-cycles in plane triangulations
cites work: The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
cites work: A lower bound on the diameter of the flip graph
cites work: Efficient algorithms for Petersen's matching theorem
cites work: Flip distance between triangulations of a planar point set is APX-hard
DOI: 10.1016/J.COMGEO.2017.06.001
Recommended article: Arc Diagrams, Flip Distances, and Hamiltonian Triangulations
Recommended article: Diagonal flips in Hamiltonian triangulations on the sphere
Recommended article: Diagonal flips in Hamiltonian triangulations on the projective plane
Recommended article: Diagonal flips in labelled planar triangulations
Recommended article: Q4942049
Recommended article: Flip graphs of bounded-degree triangulations
Recommended article: Hamiltonian triangulations and circumscribing polygons of disjoint line segments
Recommended article: Flip graphs of bounded degree triangulations
Recommended article: k-Arc Hamilton graphs
Recommended article: Hamiltonicity of 3-arc graphs
description: scientific article; zbMATH DE number 6840487