Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
>
Search Results
Catalogue Display
Catalogue Display
Previous Title
.
Thirty Essays on Geometric Graph Theory
.
Bookmark this Record
Catalogue Record 28887
.
.
Author info on Wikipedia
.
.
LibraryThing
.
.
Google Books
.
.
Amazon Books
.
Catalogue Information
Catalogue Record 28887
.
Reviews
Catalogue Record 28887
.
British Library
Resolver for RSN-28887
Google Scholar
Resolver for RSN-28887
WorldCat
Resolver for RSN-28887
Catalogo Nazionale SBN
Resolver for RSN-28887
GoogleBooks
Resolver for RSN-28887
ICTP Library
Resolver for RSN-28887
.
Share Link
Jump to link
Catalogue Information
Field name
Details
Dewey Class
511.1
Title
Thirty Essays on Geometric Graph Theory ([Ebook]) / edited by János Pach.
Author
Pach, János
Other name(s)
SpringerLink (Online service)
Publication
New York : Springer
, 2013.
Physical Details
XIII, 607 pages, 282 illus. : online resource.
ISBN
9781461401100
Summary Note
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.:
Contents note
Introduction -- 1) B. Ãbrego - S. Fernandez-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.
System details note
Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users).
Internet Site
http://dx.doi.org/10.1007/978-1-4614-0110-0
Links to Related Works
Subject References:
Combinatorics
.
Discrete Mathematics
.
Geometry
.
Mathematics
.
Authors:
Pach, János
.
Corporate Authors:
SpringerLink (Online service)
.
Classification:
511.1
.
511.1 (DDC 23)
.
.
ISBD Display
Catalogue Record 28887
.
Tag Display
Catalogue Record 28887
.
Related Works
Catalogue Record 28887
.
Marc XML
Catalogue Record 28887
.
Add Title to Basket
Catalogue Record 28887
.
Catalogue Information 28887
Beginning of record
.
Catalogue Information 28887
Top of page
.
Download Title
Catalogue Record 28887
Export
This Record
As
Labelled Format
Bibliographic Format
ISBD Format
MARC Format
MARC Binary Format
MARCXML Format
User-Defined Format:
Title
Author
Series
Publication Details
Subject
To
File
Email
Reviews
This item has not been rated.
Add a Review and/or Rating
28887
1
28887
-
2
28887
-
3
28887
-
4
28887
-
5
28887
-
Quick Search
Search for