Thirty Essays on Geometric Graph Theory

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...

Full description

Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Pach, Jǹos. (Editor)
Format: Electronic
Language:English
Published: New York, NY : Springer New York : Imprint: Springer, 2013.
Subjects:
Online Access:https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-1-4614-0110-0
LEADER 04870nam a22004455i 4500
001 12786
003 DE-He213
005 20130725230458.0
007 cr nn 008mamaa
008 121214s2013 xxu| s |||| 0|eng d
020 # # |a 9781461401100  |9 978-1-4614-0110-0 
024 7 # |a 10.1007/978-1-4614-0110-0  |2 doi 
050 # 4 |a QA150-272 
072 # 7 |a PBD  |2 bicssc 
072 # 7 |a MAT008000  |2 bisacsh 
082 0 4 |a 511.1  |2 23 
100 1 # |a Pach, Jǹos.  |e editor. 
245 1 0 |a Thirty Essays on Geometric Graph Theory  |c edited by Jǹos Pach.  |h [electronic resource] / 
264 # 1 |a New York, NY :  |b Springer New York :  |b Imprint: Springer,  |c 2013. 
300 # # |a XIII, 607 p. 282 illus.  |b online resource. 
336 # # |a text  |b txt  |2 rdacontent 
337 # # |a computer  |b c  |2 rdamedia 
338 # # |a online resource  |b cr  |2 rdacarrier 
347 # # |a text file  |b PDF  |2 rda 
505 0 # |a Introduction -- 1) B. ℓbrego - S. Fernǹdez-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. Pr̤ - D.R.Wood: Blocking coloured point sets -- 4) M. Al-Jubeh - G. Barequet - M. Ishaque - D. Souvaine - Cs. D. Tt̤h - 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šzr̀os - R. StolaY - 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. Sariz̲: 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. Tt̤h - E. Welzl: Counting plane graphs: flippability and its applications -- 16) F. Hurtado - Cs. D. Tt̤h: Geometric graph augmentation: a generic perspective -- 17) M. Kano - K. Suzuki: Discrete geometry on red and blue points in the plane lattice -- 18) Gy. Kr̀olyi: 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<U+0007> - 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. Tt̤h: A better bound for the pair-crossing number -- 30) U. Wagner: Minors, embeddability, and extremal problems for hypergraphs. 
520 # # |a 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. 
650 # 0 |a Mathematics. 
650 # 0 |a Combinatorics. 
650 # 0 |a Geometry. 
650 1 4 |a Mathematics. 
650 2 4 |a Discrete Mathematics. 
650 2 4 |a Geometry. 
650 2 4 |a Combinatorics. 
710 2 # |a SpringerLink (Online service) 
773 0 # |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9781461401094 
856 4 0 |u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-1-4614-0110-0 
912 # # |a ZDB-2-SMA 
950 # # |a Mathematics and Statistics (Springer-11649)