000 -LEADER |
fixed length control field |
04761nam a22004215i 4500 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
OSt |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20140310151446.0 |
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
fixed length control field |
cr nn 008mamaa |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
121214s2013 xxu| s |||| 0|eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9781461401100 |
|
978-1-4614-0110-0 |
050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
Classification number |
QA150-272 |
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
Classification number |
511.1 |
Edition number |
23 |
264 #1 - |
-- |
New York, NY : |
-- |
Springer New York : |
-- |
Imprint: Springer, |
-- |
2013. |
912 ## - |
-- |
ZDB-2-SMA |
100 1# - MAIN ENTRY--PERSONAL NAME |
Personal name |
Pach, János. |
Relator term |
editor. |
245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE |
Title |
Thirty Essays on Geometric Graph Theory |
Medium |
[electronic resource] / |
Statement of responsibility, etc |
edited by János Pach. |
300 ## - PHYSICAL DESCRIPTION |
Extent |
XIII, 607 p. 282 illus. |
Other physical details |
online resource. |
505 0# - FORMATTED CONTENTS NOTE |
Formatted contents note |
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. |
520 ## - SUMMARY, ETC. |
Summary, etc |
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 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Mathematics. |
|
Topical term or geographic name as entry element |
Combinatorics. |
|
Topical term or geographic name as entry element |
Geometry. |
|
Topical term or geographic name as entry element |
Mathematics. |
|
Topical term or geographic name as entry element |
Discrete Mathematics. |
|
Topical term or geographic name as entry element |
Geometry. |
|
Topical term or geographic name as entry element |
Combinatorics. |
710 2# - ADDED ENTRY--CORPORATE NAME |
Corporate name or jurisdiction name as entry element |
SpringerLink (Online service) |
773 0# - HOST ITEM ENTRY |
Title |
Springer eBooks |
776 08 - ADDITIONAL PHYSICAL FORM ENTRY |
Display text |
Printed edition: |
International Standard Book Number |
9781461401094 |
856 40 - ELECTRONIC LOCATION AND ACCESS |
Uniform Resource Identifier |
http://dx.doi.org/10.1007/978-1-4614-0110-0 |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
|
Item type |
E-Book |