Logo - springer
Slogan - springer

New & Forthcoming Titles | Thirty Essays on Geometric Graph Theory

Thirty Essays on Geometric Graph Theory

Pach, János (Ed.)

2012, XIII, 607 p. 282 illus.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$119.00

(net) price for USA

ISBN 978-1-4614-0110-0

digitally watermarked, no DRM

Included Format: PDF and EPUB

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$149.00

(net) price for USA

ISBN 978-1-4614-0109-4

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • Geometric graph theory is a fairly new discipline, which serves as a theoretical basis for information visualization and graph drawing
  • By mixing combinatorial, geometric, and topological methods, geometric graph theory has created an impressive toolbox for mathematicians and computer scientists
  • Contains 30 original survey and research papers on important recent developments in geometric graph theory
  • With contributions by leading researchers in this field

In many applications of graph theory, graphs are regarded as geometric objects drawn in the plane or in some other surface. The traditional methods of "abstract" graph theory are often incapable of providing satisfactory answers to questions arising in such applications. In the past couple of decades, many powerful new combinatorial and topological techniques have been developed to tackle these problems. Today geometric graph theory is a burgeoning field with many striking results and appealing open questions.

This contributed volume contains thirty original survey and research papers on important recent developments in geometric graph theory.  The contributions were thoroughly reviewed and written by excellent researchers in this field.

Content Level » Research

Keywords » crossing number - embedding - geometric graph augmentation - geometric graph theory - planar graphs - thrackle conjecture - topological graph - topological hypergraphs

Related subjects » Geometry & Topology

Table of contents 

Introduction.- 1) B. Ábrego - S. Fernández-Merchant - G. Salazar: The rectilinear crossing number of K_n: closing in (or are we?).- 2) E. Ackerman: The maximum number of tangencies among convex regions with a triangle-free intersection graph.- 3) G. Aloupis - B. Ballinger - S. Collette - S. Langerman - A. Pór - D.R.Wood: Blocking coloured point sets.- 4) M. Al-Jubeh - G. Barequet - M. Ishaque - D. Souvaine - Cs. D. Tóth - A. Winslow: Constrained tri-connected planar straight line graphs.- 5) S. Buzaglo - R. Pinchasi - G. Rote: Topological hypergraphs.- 6) J. Cano Vila - L. F. Barba - J. Urrutia - T. Sakai:  On edge-disjoint empty triangles of point sets.- 7) J. Cibulka - J. Kynčl - V. Mészáros - R. Stolař - P. Valtr: Universal sets for straight-line embeddings of bicolored graphs.- 8) G. Di Battista - F. Frati: Drawing trees, outerplanar graphs, series-parallel graphs, and planar graphs in small area.- 9) W. Didimo - G. Liotta: The crossing angle resolution in graph drawing.- 10) A. Dumitrescu: Mover problems.- 11) S. Felsner: Rectangle and square representations of planar graphs.- 12) R. Fulek - N. Saeedi - D. Sariöz: Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs.- 13) R. Fulek - M. Pelsmajer - M. Schaefer - D. Štefankovič: Hanani-Tutte, monotone drawings, and level-planarity.- 14) R. Fulek - A. Suk: On disjoint crossing families in geometric graphs.- 15) M. Hoffmann - A. Schulz - M. Sharir - A. Sheffer - Cs. D. Tóth - E. Welzl: Counting plane graphs: flippability and its applications.- 16) F. Hurtado - Cs. D. Tóth: Geometric graph augmentation: a generic perspective.- 17) M. Kano - K. Suzuki: Discrete geometry on red and blue points in the plane lattice.- 18) Gy. Károlyi: Ramsey-type problems for geometric graphs.- 19) Ch. Keller - M. Perles - E. Rivera-Campo - V. Urrutia-Galicia: Blockers for non-crossing spanning trees in complete geometric graphs.- 20) A. V. Kostochka - K. G. Milans: Coloring clean and K_4-free circle graphs.- 21) F. Morić - D. Pritchard: Counting large distances in convex polygons: a computational approach.- 22) A. Raigorodskii: Coloring distance graphs and graphs of diameters.- 23) M. Schaefer: Realizability of graphs and linkages.- 24) C. Smyth: Equilateral sets in l_dp.- 25) A. Suk: A note on geometric 3-hypergraphs.- 26) K. Swanepoel: Favourite distances in high dimensions.- 27) M. Tancer: Intersection patterns of convex sets via simplicial complexes, a survey.- 28) G. Tardos: Construction of locally plane graphs with many edges.- 29) G. Tóth: A better bound for the pair-crossing number.- 30) U. Wagner: Minors, embeddability, and extremal problems for hypergraphs.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Discrete Mathematics.