It looks like you're offline.
Open Library logo
additional options menu

MARC record from Internet Archive

LEADER: 07293cam 2200865 a 4500
001 ocn822965725
003 OCoLC
005 20220827112517.0
008 121226s2013 nyua ob 000 0 eng d
006 m o d
007 cr cnu---unuuu
040 $aGW5XE$beng$epn$cGW5XE$dYDXCP$dCOO$dN$T$dZMC$dSNK$dIDEBK$dE7B$dOCLCF$dOCLCO$dVT2$dCDX$dOCLCQ$dOCLCO$dOCLCQ$dESU$dOCLCQ$dIOG$dNJR$dCNCGM$dREB$dOCLCQ$dU3W$dWYU$dUWO$dTKN$dOCLCQ$dLEAUB$dUKAHL$dOL$$dOCLCQ$dDCT$dERF$dAJS$dOCLCQ$dOCLCO$dOCLCQ$dOCLCO
019 $a827955476$a889217123$a985046053$a1005778401$a1069579032$a1110783316$a1112531146$a1162806091
020 $a9781461401100$q(electronic bk.)
020 $a1461401100$q(electronic bk.)
020 $a9781283933490$q(MyiLibrary)
020 $a1283933497$q(MyiLibrary)
020 $z9781461401094
020 $z1461401097
024 7 $a10.1007/978-1-4614-0110-0$2doi
035 $a(OCoLC)822965725$z(OCoLC)827955476$z(OCoLC)889217123$z(OCoLC)985046053$z(OCoLC)1005778401$z(OCoLC)1069579032$z(OCoLC)1110783316$z(OCoLC)1112531146$z(OCoLC)1162806091
037 $a424599$bMIL
050 4 $aQA166$b.T45 2013
072 7 $aMAT$x013000$2bisacsh
072 7 $aMAT$2eflch
072 7 $aPBD$2bicssc
082 04 $a511.5$223
245 00 $aThirty essays on geometric graph theory /$cJános Pach, editor.
246 3 $a30 essays on geometric graph theory
260 $aNew York :$bSpringer,$c©2013.
300 $a1 online resource :$billustrations (some color)
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
347 $atext file
347 $bPDF
490 1 $aAlgorithms and combinatorics ;$v29
505 00 $tIntroduction /$rJános Pach --$tThe Rectilinear Crossing Number of K n : Closing in (or Are We?) /$rBernardo M. Ábrego, Silvia Fernández-Merchant --$tThe Maximum Number of Tangencies Among Convex Regions with a Triangle-Free Intersection Graph /$rEyal Ackerman --$tThirty Essays on Geometric Graph Theory /$rGreg Aloupis, Brad Ballinger, Sébastien Collette --$tConstrained Tri-Connected Planar Straight Line Graphs /$rMarwan Al-Jubeh, Gill Barequet, Mashhood Ishaque --$tTopological Hypergraphs /$rSarit Buzaglo, Rom Pinchasi, Günter Rote --$tOn Edge-Disjoint Empty Triangles of Point Sets /$rJavier Cano, Luis F. Barba, Toshinori Sakai --$tUniversal Sets for Straight-Line Embeddings of Bicolored Graphs /$rJosef Cibulka, Jan Kynčl, Viola Mészáros --$tDrawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area /$rGiuseppe Di Battista, Fabrizio Frati.
505 80 $tThe Crossing-Angle Resolution in Graph Drawing /$rWalter Didimo, Giuseppe Liotta --$tMover Problems /$rAdrian Dumitrescu --$tRectangle and Square Representations of Planar Graphs /$rStefan Felsner --$tConvex Obstacle Numbers of Outerplanar Graphs and Bipartite Permutation Graphs /$rRadoslav Fulek, Noushin Saeedi, Deniz Sarıöz --$tHanani-Tutte, Monotone Drawings, and Level-Planarity /$rRadoslav Fulek, Michael J. Pelsmajer --$tOn Disjoint Crossing Families in Geometric Graphs /$rRadoslav Fulek, Andrew Suk --$tCounting Plane Graphs: Flippability and Its Applications /$rMichael Hoffmann, André Schulz, Micha Sharir --$tPlane Geometric Graph Augmentation: A Generic Perspective /$rFerran Hurtado, Csaba D. Tóth --$tDiscrete Geometry on Red and Blue Points in the Plane Lattice /$rMikio Kano, Kazuhiro Suzuki --$tRamsey-Type Problems for Geometric Graphs /$rGyula Károlyi.
505 80 $tBlockers for Noncrossing Spanning Trees in Complete Geometric Graphs /$rChaya Keller, Micha A. Perles --$tColoring Clean and K ₄-Free Circle Graphs /$rAlexandr V. Kostochka, Kevin G. Milans --$tCounting Large Distances in Convex Polygons: A Computational Approach /$rFilip Morić, David Pritchard --$tColoring Distance Graphs and Graphs of Diameters /$rAndrei M. Raigorodskii --$tRealizability of Graphs and Linkages /$rMarcus Schaefer --$tEquilateral Sets in ldp /$rClifford Smyth --$tA Note on Geometric 3-Hypergraphs /$rAndrew Suk --$tFavorite Distances in High Dimensions /$rKonrad J. Swanepoel --$tIntersection Patterns of Convex Sets via Simplicial Complexes: A Survey /$rMartin Tancer --$tConstruction of Locally Plane Graphs with Many Edges /$rGábor Tardos --$tA Better Bound for the Pair-Crossing Number /$rGéza Tóth --$tMinors, Embeddability, and Extremal Problems for Hypergraphs /$rUli Wagner.
504 $aIncludes bibliographical references.
588 0 $aPrint version record.
520 $aIn 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 $aGraph theory.
650 0 $aCombinatorial geometry.
650 0 $aGeometry$xData processing.
650 6 $aGéométrie combinatoire.
650 6 $aGéométrie$xInformatique.
650 7 $aMATHEMATICS$xGraphic Methods.$2bisacsh
650 7 $aCombinatorial geometry.$2fast$0(OCoLC)fst00868972
650 7 $aGeometry$xData processing.$2fast$0(OCoLC)fst00940870
650 7 $aGraph theory.$2fast$0(OCoLC)fst00946584
655 4 $aElectronic books.
700 1 $aPach, János.
776 08 $iPrint version:$tThirty essays on geometric graph theory.$dNew York ; London : Springer, 2012$z9781461401094$w(OCoLC)768072591
830 0 $aAlgorithms and combinatorics ;$v29.
856 40 $3ebrary$uhttp://site.ebrary.com/id/10640907
856 40 $3EBSCOhost$uhttps://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=523147
856 40 $3MyiLibrary$uhttp://www.myilibrary.com?id=424599
856 40 $3SpringerLink$uhttps://doi.org/10.1007/978-1-4614-0110-0
856 40 $3SpringerLink$uhttps://link.springer.com/book/10.1007%2F978-1-4614-0109-4
856 40 $3SpringerLink$uhttps://link.springer.com/book/10.1007%2F978-1-4614-0110-0
856 40 $3VLeBooks$uhttp://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9781461401100
856 4 $uhttps://discover.gcu.ac.uk/discovery/openurl?institution=44GLCU_INST&vid=44GLCU_INST:44GLCU_VU2&?u.ignore_date_coverage=true&rft.mms_id=991002482705403836$p5370277250003836$xStGlGCU
938 $aAskews and Holts Library Services$bASKH$nAH28325865
938 $aCoutts Information Services$bCOUT$n24508838$c99.50 GBP
938 $aebrary$bEBRY$nebr10640907
938 $aEBSCOhost$bEBSC$n523147
938 $aProQuest MyiLibrary Digital eBook Collection$bIDEB$ncis24508838
938 $aYBP Library Services$bYANK$n9957447
029 1 $aAU@$b000050544429
029 1 $aNLGGC$b356767248
029 1 $aNZ1$b14831129
994 $aZ0$bIME
948 $hNO HOLDINGS IN IME - 321 OTHER HOLDINGS