Thirty Essays on Geometric Graph Theory

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Introduction
3. Altmetric Badge
   Chapter 2 The Rectilinear Crossing Number of K n : Closing in (or Are We?)
4. Altmetric Badge
   Chapter 3 The Maximum Number of Tangencies Among Convex Regions with a Triangle-Free Intersection Graph
5. Altmetric Badge
   Chapter 4 Blocking Colored Point Sets
6. Altmetric Badge
   Chapter 5 Constrained Tri-Connected Planar Straight Line Graphs
7. Altmetric Badge
   Chapter 6 Topological Hypergraphs
8. Altmetric Badge
   Chapter 7 On Edge-Disjoint Empty Triangles of Point Sets
9. Altmetric Badge
   Chapter 8 Universal Sets for Straight-Line Embeddings of Bicolored Graphs
10. Altmetric Badge
    Chapter 9 Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area
11. Altmetric Badge
    Chapter 10 The Crossing-Angle Resolution in Graph Drawing
12. Altmetric Badge
    Chapter 11 Mover Problems
13. Altmetric Badge
    Chapter 12 Rectangle and Square Representations of Planar Graphs
14. Altmetric Badge
    Chapter 13 Convex Obstacle Numbers of Outerplanar Graphs and Bipartite Permutation Graphs
15. Altmetric Badge
    Chapter 14 Hanani–Tutte, Monotone Drawings, and Level-Planarity
16. Altmetric Badge
    Chapter 15 On Disjoint Crossing Families in Geometric Graphs
17. Altmetric Badge
    Chapter 16 Counting Plane Graphs: Flippability and Its Applications
18. Altmetric Badge
    Chapter 17 Plane Geometric Graph Augmentation: A Generic Perspective
19. Altmetric Badge
    Chapter 18 Discrete Geometry on Red and Blue Points in the Plane Lattice
20. Altmetric Badge
    Chapter 19 Ramsey-Type Problems for Geometric Graphs
21. Altmetric Badge
    Chapter 20 Blockers for Noncrossing Spanning Trees in Complete Geometric Graphs
22. Altmetric Badge
    Chapter 21 Coloring Clean and K 4-Free Circle Graphs
23. Altmetric Badge
    Chapter 22 Counting Large Distances in Convex Polygons: A Computational Approach
24. Altmetric Badge
    Chapter 23 Coloring Distance Graphs and Graphs of Diameters
25. Altmetric Badge
    Chapter 24 Realizability of Graphs and Linkages
26. Altmetric Badge
    Chapter 25 Equilateral Sets in \({\mathcal{l}}_{p}^{d}\)
27. Altmetric Badge
    Chapter 26 A Note on Geometric 3-Hypergraphs
28. Altmetric Badge
    Chapter 27 Favorite Distances in High Dimensions
29. Altmetric Badge
    Chapter 28 Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
30. Altmetric Badge
    Chapter 29 Construction of Locally Plane Graphs with Many Edges
31. Altmetric Badge
    Chapter 30 A Better Bound for the Pair-Crossing Number
32. Altmetric Badge
    Chapter 31 Minors, Embeddability, and Extremal Problems for Hypergraphs
33. Altmetric Badge
    Chapter 32 Erratum to