Andrea Francke
ABSTRACT
It is shown that on every n-element point set in the plane, at most exp(O(kn)) labeled planar graphs can be embedded using polyline edges with k bends per edge. This is the first exponential upper bound for the number of labeled plane graphs where the edges are polylines of constant size. Several standard tools developed for the enumeration of straight-line graphs, such as triangulations and crossing numbers, are unavailable in this scenario. Furthermore, the exponential upper bound does not carry over to other popular relaxations of straight-line edges: for example, the number of plane graphs realizable with x-monotone edges on n points is already super-exponential.
- O. Aichholzer, T. Hackl, B. Vogtenhuber, C. Huemer, F. Hurtado and H. Krasser, On the number of plane geometric graphs, Graphs and Combinatorics 23 (1) (2007), 67--84. Google Scholar
Digital Library
- M. Ajtai, V. Chvátal, M. Newborn and E. Szemerédi, Crossing-free subgraphs, Annals Discrete Math. 12 (1982), 9--12.Google Scholar
- V. Alvarez, K. Bringmann, R. Curticapean, and S. Ray, Counting crossing-free structures, in Proc. 28th Sympos. on Comput. Geom. 2012, ACM Press, pp. 61--68. Google ScholarDigital Library
- O. Bastert and S. P. Fekete, Geometric wire routing, Technical Report 332, University of Cologne, 1998.Google Scholar
- S. Bespamyatnikh, Computing homotopic shortest paths in the plane, J. Algorithms 49 (2) (2003), 284--303. Google ScholarDigital Library
- S. Bespamyatnikh, Encoding homotopy of paths in the plane, in Proc. 6th LATIN, LNCS 2976, Springer, 2004, pp. 329--338.Google ScholarCross Ref
- N. Bonichon, C. Gavoille, N. Hanusse, D. Poulalhon, and G. Schaeffer, Planar graphs, via well-orderly maps and trees, Graphs and Combinatorics 22 (2006), 185--202.Google ScholarCross Ref
- S. Cabello, Y. Liu, A. Mantler, and J. Snoeyink, Testing homotopy for paths in the plane, Discrete Comput. Geom. 31 (1) (2004), 61--81.Google ScholarDigital Library
- A. Dumitrescu, A. Schulz, A. Sheffer and Cs. D. Tóth, Bounds on the maximum multiplicity of some common geometric graphs, SIAM Discrete Math. 27 (2) (2013), 802--826.Google ScholarCross Ref
- C. A. Duncan, A. Efrat, S. Kobourov, and C. Wenk, Drawing with fat edges, Intern. J. Foundations Comp. Sci. 17 (2006), 1143--1164.Google ScholarCross Ref
- A. Efrat, S. G. Kobourov, and A. Lubiw, Computing homotopic shortest paths efficiently, Comput Geom. 35 (2006), 162--172. Google ScholarDigital Library
- H. Everett, S. Lazard, G. Liotta, and S. K. Wismath, Universal sets of n points for one-bend drawings of planar graphs with n vertices, Discrete Comput. Geom. 43 (2) (2010), 272--288. Google ScholarDigital Library
- P. Flajolet and M. Noy, Analytic combinatorics of non-crossing configurations, Discrete Mathematics 204 (1999), 203--229. Google ScholarDigital Library
- O. Giménez and M. Noy, Asymptotic enumeration and limit laws of planar graphs, JAMS 22 (2009), 309--329.Google ScholarCross Ref
- J. Hershberger and J. Snoeyink, Computing minimum length paths of a given homotopy class, Comput. Geom. 4 (2) (1994), 63--97. Google ScholarDigital Library
- M. Hoffmann, M. Sharir, A. Schulz, A. Sheffer, Cs. D. Tóth, and E. Welzl, Counting plane graphs: flippability and its applications, in Thirty Essays on Geometric Graph Theory (J. Pach, ed.), Springer, 2013, pp. 303--326. Google ScholarDigital Library
- M. Kaufmann and R. Wiese, Embedding vertices at points: few bends suffice for planar graphs, J. Graph Alg. Appl. 6 (1) (2002), 115--129.Google ScholarCross Ref
- M. Löffler, A. Schulz, and Cs. D. Tóth, Counting carambolas, in Proc. 25th Canadian Conf. on Comput. Geom. (Waterloo, ON, 2013), pp. 163--168.Google Scholar
- J. Pach and G. Tóth, Monotone drawings of planar graphs, Journal of Graph Theory 46 (1) (2004), 39--47. Google ScholarDigital Library
- J. Pach and R. Wenger, Embedding planar graphs at fixed vertex locations, Graphs and Combinatorics 17 (4) (2001), 717--728.Google ScholarCross Ref
- F. Santos and R. Seidel, A better upper bound on the number of triangulations of a planar point set, J. Combin. Theory, Ser. A 102 (2003), 186--193. Google ScholarDigital Library
- M. Sharir and A. Sheffer, Counting triangulations of planar point sets, Electronic Journal of Combinatorics 18 (2011), P70.Google ScholarCross Ref
- M. Sharir and A. Sheffer, Counting plane graphs: cross-graph charging schemes, Combinat. Probab. Comput. 22 (2013), 935--954.Google ScholarCross Ref
- M. Sharir and E. Welzl, Random triangulations of planar point sets, in Proc. 22nd ACM Sympos. on Comput. Geom., ACM Press, 2006, pp. 273--281. Google ScholarDigital Library
- G. Turán, On the succinct representation of graphs, Discrete Appl. Math. 8 (1984), 289--294.Google ScholarCross Ref
- H. Whitney, Congruent graphs and the connectivity of graphs, Amer. J. Math. 54 (1932), 150--168.Google ScholarCross Ref
Index Terms
- A Census of Plane Graphs with Polyline Edges
Recommendations
A Census of Plane Graphs with Polyline Edges
We study vertex-labeled graphs that can be embedded on a given point set such that every edge is a polyline with $k$ bends per edge, where $k\in \mathbb{N}$. It is shown that on every $n$-element point set in the plane, at most $\exp(O(n\log(2+k)))$ ...
Contractible edges in minimally k-connected graphs
An edge of a k-connected graph is said to be k-contractible if the contraction of the edge results in a k-connected graph. In this paper, we prove that a (K"1+C"4)-free minimally k-connected graph has a k-contractible edge, if incident to each vertex of ...
Contractible and Removable Edges in 3-Connected Infinite Graphs
Several results concerning contractible and removable edges in 3-connected finite graphs are extended to infinite graphs. First, we prove that every 3-connected locally finite infinite graph has infinitely many removable edges. Next, we prove that for ...
Comments