Counting Plane Graphs: Flippability and Its Applications
From MaRDI portal
Publication:2847913
DOI10.1007/978-1-4614-0110-0_16zbMath1272.05080arXiv1012.0591OpenAlexW2952780231MaRDI QIDQ2847913
No author found.
Publication date: 25 September 2013
Published in: Lecture Notes in Computer Science, Thirty Essays on Geometric Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.0591
Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (19)
Configurations of non-crossing rays and related problems ⋮ Counting carambolas ⋮ A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set ⋮ Crossings in grid drawings ⋮ An upper bound for the number of rectangulations of a planar point set ⋮ Disjoint compatible geometric matchings ⋮ A QPTAS for the base of the number of crossing-free structures on a planar point set ⋮ Colored ray configurations ⋮ On numbers of pseudo-triangulations ⋮ Simultaneously Flippable Edges in Triangulations ⋮ Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees ⋮ Transition operations over plane trees ⋮ Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees ⋮ A Census of Plane Graphs with Polyline Edges ⋮ Counting triangulations and other crossing-free structures approximately ⋮ Geometric biplane graphs. I: Maximal graphs ⋮ Connectivity of triangulation flip graphs in the plane ⋮ Lower bounds on the maximum number of non-crossing acyclic graphs ⋮ Counting triangulations and other crossing-free structures via onion layers
Uses Software
This page was built for publication: Counting Plane Graphs: Flippability and Its Applications
