Thirty Essays on Geometric Graph Theory

Pach, János

Thirty Essays on Geometric Graph Theory

Edited by János Pach

in Springer Books from Springer

Date: 2013
ISBN: 978-1-4614-0110-0
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Chapters in this book:

Erratum to: János Pach
Introduction: János Pach
The Rectilinear Crossing Number of K n: Closing in (or Are We?): Bernardo M. Ábrego, Silvia Fernández-Merchant and Gelasio Salazar
The Maximum Number of Tangencies Among Convex Regions with a Triangle-Free Intersection Graph: Eyal Ackerman
Blocking Colored Point Sets: Greg Aloupis, Brad Ballinger, Sébastien Collette, Stefan Langerman, Attila Pór and David R. Wood
Constrained Tri-Connected Planar Straight Line Graphs: Marwan Al-Jubeh, Gill Barequet, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth and Andrew Winslow
Topological Hypergraphs: Sarit Buzaglo, Rom Pinchasi and Günter Rote
On Edge-Disjoint Empty Triangles of Point Sets: Javier Cano, Luis F. Barba, Toshinori Sakai and Jorge Urrutia
Universal Sets for Straight-Line Embeddings of Bicolored Graphs: Josef Cibulka, Jan Kynčl, Viola Mészáros, Rudolf Stolař and Pavel Valtr
Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area: Giuseppe Di Battista and Fabrizio Frati
The Crossing-Angle Resolution in Graph Drawing: Walter Didimo and Giuseppe Liotta
Mover Problems: Adrian Dumitrescu
Rectangle and Square Representations of Planar Graphs: Stefan Felsner
Convex Obstacle Numbers of Outerplanar Graphs and Bipartite Permutation Graphs: Radoslav Fulek, Noushin Saeedi and Deniz Sarıöz
Hanani–Tutte, Monotone Drawings, and Level-Planarity: Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer and Daniel Štefankovič
On Disjoint Crossing Families in Geometric Graphs: Radoslav Fulek and Andrew Suk
Counting Plane Graphs: Flippability and Its Applications: Michael Hoffmann, André Schulz, Micha Sharir, Adam Sheffer, Csaba D. Tóth and Emo Welzl
Plane Geometric Graph Augmentation: A Generic Perspective: Ferran Hurtado and Csaba D. Tóth
Discrete Geometry on Red and Blue Points in the Plane Lattice: Mikio Kano and Kazuhiro Suzuki
Ramsey-Type Problems for Geometric Graphs: Gyula Károlyi
Blockers for Noncrossing Spanning Trees in Complete Geometric Graphs: Chaya Keller, Micha A. Perles, Eduardo Rivera-Campo and Virginia Urrutia-Galicia
Coloring Clean and K 4-Free Circle Graphs: Alexandr V. Kostochka and Kevin G. Milans
Counting Large Distances in Convex Polygons: A Computational Approach: Filip Morić and David Pritchard
Coloring Distance Graphs and Graphs of Diameters: Andrei M. Raigorodskii
Realizability of Graphs and Linkages: Marcus Schaefer
Equilateral Sets in $${\mathcal{l}}_{p}^{d}$$: Clifford Smyth
A Note on Geometric 3-Hypergraphs: Andrew Suk
Favorite Distances in High Dimensions: Konrad J. Swanepoel
Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey: Martin Tancer
Construction of Locally Plane Graphs with Many Edges: Gábor Tardos
A Better Bound for the Pair-Crossing Number: Géza Tóth
Minors, Embeddability, and Extremal Problems for Hypergraphs: Uli Wagner

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprbok:978-1-4614-0110-0

Ordering information: This item can be ordered from
http://www.springer.com/9781461401100

DOI: 10.1007/978-1-4614-0110-0

Access Statistics for this book

More books in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().