Book 2013

Thirty Essays on Geometric Graph Theory

Editors:

ISBN: 978-1-4614-0109-4 (Print) 978-1-4614-0110-0 (Online)

Table of contents (32 chapters)

previous Page of 2
  1. Front Matter

    Pages i-xiii

  2. No Access

    Chapter

    Pages 1-4

    Introduction

  3. No Access

    Chapter

    Pages 5-18

    The Rectilinear Crossing Number of K n : Closing in (or Are We?)

  4. No Access

    Chapter

    Pages 19-30

    The Maximum Number of Tangencies Among Convex Regions with a Triangle-Free Intersection Graph

  5. No Access

    Chapter

    Pages 31-48

    Blocking Colored Point Sets

  6. No Access

    Chapter

    Pages 49-70

    Constrained Tri-Connected Planar Straight Line Graphs

  7. No Access

    Chapter

    Pages 71-81

    Topological Hypergraphs

  8. No Access

    Chapter

    Pages 83-100

    On Edge-Disjoint Empty Triangles of Point Sets

  9. No Access

    Chapter

    Pages 101-119

    Universal Sets for Straight-Line Embeddings of Bicolored Graphs

  10. No Access

    Chapter

    Pages 121-165

    Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area

  11. No Access

    Chapter

    Pages 167-184

    The Crossing-Angle Resolution in Graph Drawing

  12. No Access

    Chapter

    Pages 185-211

    Mover Problems

  13. No Access

    Chapter

    Pages 213-248

    Rectangle and Square Representations of Planar Graphs

  14. No Access

    Chapter

    Pages 249-261

    Convex Obstacle Numbers of Outerplanar Graphs and Bipartite Permutation Graphs

  15. No Access

    Chapter

    Pages 263-287

    Hanani–Tutte, Monotone Drawings, and Level-Planarity

  16. No Access

    Chapter

    Pages 289-302

    On Disjoint Crossing Families in Geometric Graphs

  17. No Access

    Chapter

    Pages 303-325

    Counting Plane Graphs: Flippability and Its Applications

  18. No Access

    Chapter

    Pages 327-354

    Plane Geometric Graph Augmentation: A Generic Perspective

  19. No Access

    Chapter

    Pages 355-369

    Discrete Geometry on Red and Blue Points in the Plane Lattice

  20. No Access

    Chapter

    Pages 371-382

    Ramsey-Type Problems for Geometric Graphs

  21. No Access

    Chapter

    Pages 383-397

    Blockers for Noncrossing Spanning Trees in Complete Geometric Graphs

previous Page of 2