On the number of plane geometric graphs
From MaRDI portal
Publication:2373434
Recommendations
Cites work
- 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
- Abstract order type extension and new results on the rectilinear crossing number
- Analytic combinatorics of non-crossing configurations
- Convexity minimizes pseudo-triangulations
- Crossing-Free Subgraphs
- Enumerating order types for small point sets with applications
- scientific article; zbMATH DE number 5506218 (Why is no real title available?)
- Lower bounds on the number of crossing-free subgraphs of \(K_N\)
- On the crossing number of complete graphs
- On the number of crossing-free matchings, (cycles, and partitions)
- On the Number of Crossing‐Free Matchings, Cycles, and Partitions
- On the number of plane graphs
- On the number of pseudo-triangulations of certain point sets
- Research Problems in Discrete Geometry
- The On-Line Encyclopedia of Integer Sequences
- The polytope of non-crossing graphs on a planar point set
Cited in
(44)- On the enumeration of a class of plane multigraphs
- Order on order types
- Point sets with many non-crossing perfect matchings
- Colored ray configurations
- On numbers of pseudo-triangulations
- Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees
- Perfect matchings with crossings
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
- Counting polygon triangulations is hard
- Twenty years of progress of \(\mathrm{JCDCG}^3\)
- A new lower bound on the maximum number of plane graphs using production matrices
- Counting triangulations and other crossing-free structures approximately
- Geometric biplane graphs. I: Maximal graphs
- Lower bounds on the maximum number of non-crossing acyclic graphs
- Counting triangulations and other crossing-free structures via onion layers
- Configurations of non-crossing rays and related problems
- Bounds on the maximum multiplicity of some common geometric graphs
- Counting carambolas
- The Mathematics of Ferran Hurtado: A Brief Survey
- Counting plane graphs with exponential speed-up
- Bounds on the maximum multiplicity of some common geometric graphs
- Plane subgraphs in geometric complement of 2-factor and complete bipartite geometric graph
- Convex polygons in geometric triangulations
- On the number of crossing-free partitions
- Maximizing Maximal Angles for Plane Straight-Line Graphs
- scientific article; zbMATH DE number 2042236 (Why is no real title available?)
- On the component number of links from plane graphs
- scientific article; zbMATH DE number 7559233 (Why is no real title available?)
- Counting triangulations of some classes of subdivided convex polygons
- Geometry and generation of a new graph planarity game
- 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
- Convex Polygons in Geometric Triangulations
- Counting plane graphs: cross-graph charging schemes
- Increasing-chord graphs on point sets
- Fast enumeration algorithms for non-crossing geometric graphs
- Increasing-chord graphs on point sets
- An upper bound for the number of rectangulations of a planar point set
- Perfect matchings with crossings
- On the number of drawings of a combinatorial triangulation
- Chains, Koch chains, and point sets with many triangulations
- Maximizing maximal angles for plane straight-line graphs
- Flips in planar graphs
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
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)
