On the number of plane geometric graphs
DOI10.1007/S00373-007-0704-5zbMATH Open1119.05056DBLPjournals/gc/AichholzerHHHKV07OpenAlexW2000008376WikidataQ61732493 ScholiaQ61732493MaRDI QIDQ2373434FDOQ2373434
Authors: T. Hackl, Clemens Huemer, Hannes Krasser, Birgit Vogtenhuber, Oswin Aichholzer, Ferran Hurtado
Publication date: 19 July 2007
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-007-0704-5
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Research Problems in Discrete Geometry
- Analytic combinatorics of non-crossing configurations
- Lower bounds on the number of crossing-free subgraphs of \(K_N\)
- A better upper bound on the number of triangulations of a planar point set
- A lower bound on the number of triangulations of planar point sets
- On the number of pseudo-triangulations of certain point sets
- On the Number of Crossing‐Free Matchings, Cycles, and Partitions
- Crossing-Free Subgraphs
- Convexity minimizes pseudo-triangulations
- Abstract order type extension and new results on the rectilinear crossing number
- Enumerating order types for small point sets with applications
- On the number of plane graphs
- Title not available (Why is that?)
- On the crossing number of complete graphs
- On the number of crossing-free matchings, (cycles, and partitions)
- The polytope of non-crossing graphs on a planar point set
Cited In (42)
- Title not available (Why is that?)
- Plane subgraphs in geometric complement of 2-factor and complete bipartite geometric graph
- Geometric biplane graphs. I: Maximal graphs
- Counting plane graphs with exponential speed-up
- Increasing-chord graphs on point sets
- Configurations of non-crossing rays and related problems
- Perfect matchings with crossings
- Increasing-chord graphs on point sets
- Convex Polygons in Geometric Triangulations
- Counting carambolas
- A Census of Plane Graphs with Polyline Edges
- Geometry and generation of a new graph planarity game
- Perfect matchings with crossings
- Twenty years of progress of \(\mathrm{JCDCG}^3\)
- On the component number of links from plane graphs
- Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees
- Title not available (Why is that?)
- A new lower bound on the maximum number of plane graphs using production matrices
- Point sets with many non-crossing perfect matchings
- Order on order types
- Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees
- Lower bounds on the maximum number of non-crossing acyclic graphs
- On numbers of pseudo-triangulations
- Counting triangulations and other crossing-free structures via onion layers
- Counting polygon triangulations is hard
- Convex polygons in geometric triangulations
- Fast enumeration algorithms for non-crossing geometric graphs
- Bounds on the maximum multiplicity of some common geometric graphs
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
- On the number of crossing-free partitions
- Bounds on the maximum multiplicity of some common geometric graphs
- Maximizing Maximal Angles for Plane Straight-Line Graphs
- Colored ray configurations
- An upper bound for the number of rectangulations of a planar point set
- The Mathematics of Ferran Hurtado: A Brief Survey
- Maximizing maximal angles for plane straight-line graphs
- Counting triangulations of some classes of subdivided convex polygons
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
- Flips in planar graphs
- Counting plane graphs: cross-graph charging schemes
- On the enumeration of a class of plane multigraphs
- Counting triangulations and other crossing-free structures approximately
This page was built for publication: On the number of plane geometric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373434)