Counting Plane Graphs: Cross-Graph Charging Schemes

DOI10.1017/S096354831300031XzbMath1282.05169arXiv1209.0194OpenAlexW2090290344MaRDI QIDQ5397740

Adam Sheffer, Micha Sharir

Publication date: 24 February 2014

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.0194

zbMATH Keywords

connected plane graphsbi-connected plane graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (10)

Convex Polygons in Geometric Triangulations ⋮ Convex Polygons in Geometric Triangulations ⋮ On the number of anchored rectangle packings for a planar point set ⋮ On the Number of Anchored Rectangle Packings for a Planar Point Set ⋮ Crossings in grid drawings ⋮ An upper bound for the number of rectangulations of a planar point set ⋮ The Mathematics of Ferran Hurtado: A Brief Survey ⋮ Monotone paths in geometric triangulations ⋮ A new lower bound on the maximum number of plane graphs using production matrices ⋮ A Census of Plane Graphs with Polyline Edges

Cites Work

• On degrees in random triangulations of point sets
• On the maximum number of edges in quasi-planar graphs
• On the maximum number of edges in topological graphs with no four pairwise crossing edges
• 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
• On the number of plane geometric graphs
• Thirty Essays on Geometric Graph Theory
• Number of Crossing-Free Geometric Graphs vs. Triangulations
• Surveys on Discrete and Computational Geometry

This page was built for publication: Counting Plane Graphs: Cross-Graph Charging Schemes