Towards a Theory of Geometric Graphs

From MaRDI portal





The articles of this volume will be reviewed individually. Indexed articles: \textit{Alt, Helmut; Knauer, Christian; Rote, Günter; Whitesides, Sue}, On the complexity of the linkage reconfiguration problem, 1-13 [Zbl 1088.68809] \textit{Arutyunyants, G.; Iosevich, A.}, Falconer conjecture, spherical averages and discrete analogs, 15-24 [Zbl 1096.28003] \textit{Brass, Peter}, Turán-type extremal problems for convex geometric hypergraphs, 25-33 [Zbl 1060.05074] \textit{Cairns, Grant; McIntyre, Margaret; Nikolayevsky, Yury}, The thrackle conjecture for \(K_5\) and \(K_{3,3}\), 35-54 [Zbl 1061.05026] \textit{Dujmović, Vida; Wood, David R.}, Three-dimensional grid drawings with sub-quadratic volume, 55-66 [Zbl 1077.05066] \textit{Dumitrescu, Adrian; Radoičić, Radoš}, On a coloring problem for the integer grid, 67-74 [Zbl 1061.05093] \textit{Eppstein, David}, Separating thickness from geometric thickness, 75-86 [Zbl 1067.05022] \textit{Jamison, Robert E.}, Direction trees in centered polygons, 87-98 [Zbl 1077.05067] \textit{Kaneko, Atsushi; Kano, M.; Suzuki, Kazuhiro}, Path coverings of two sets of points in the plane, 99-111 [Zbl 1064.52013] \textit{Katona, Gyula O. H.; Mayer, Richard; Woyczynski, Wojbor A.}, Length of sums in a Minkowski space, 113-118 [Zbl 1076.46007] \textit{Katz, Nets Hawk; Tardos, Gabór}, A new entropy inequality for the Erdős distance problem, 119-126 [Zbl 1069.52017] \textit{Kostochka, Alexandr}, Coloring intersection graphs of geometric figures with a given clique number, 127-138 [Zbl 1064.05059] \textit{Lovász, László; Vesztergombi, Katalin; Wagner, Uli; Welzl, Emo}, Convex quadrilaterals and \(k\)-sets, 139-148 [Zbl 1071.05028] \textit{Maehara, Hiroshi}, Distance graphs and rigidity, 149-168 [Zbl 1077.05068] \textit{Nešetřil, Jaroslav; Solymosi, József; Valtr, Pavel}, A Ramsey property of planar graphs, 169-176 [Zbl 1063.05102] \textit{Pach, János; Radoičić, Radoš; Tóth, Géza}, A generalization of quasi-planarity, 177-183 [Zbl 1074.05028] \textit{Pach, János; Sharir, Micha}, Geometric incidences, 185-223 [Zbl 1072.52012] \textit{Perles, Micha A.; Pinchasi, Rom}, Large sets must have either a \(k\)-edge or a \((k+2)\)-edge, 225-232 [Zbl 1067.51001] \textit{Pinchasi, Rom; Radoičić, Radoš}, Topological graphs with no self-intersecting cycle of length 4, 233-243 [Zbl 1073.05021] \textit{Ruzsa, Imre Z.}, A problem on restricted sumsets, 245-248 [Zbl 1068.11017] \textit{Shahrokhi, F.; Sýkora, O.; Székely, L. A.; Vrťo, I.}, The gap between crossing numbers and convex crossing numbers, 249-258 [Zbl 1062.05050] \textit{Solymosi, József; Vu, Van}, Distinct distances in high dimensional homogeneous sets, 259-268 [Zbl 1064.52011] \textit{Spencer, Joel}, The biplanar crossing number of the random graph, 269-271 [Zbl 1059.05041] \textit{Swanepoel, Konrad J.; Valtr, Pavel}, The unit distance problem on spheres, 273-279 [Zbl 1065.52013] \textit{Székely, László A.}, Short proof for a theorem of Pach, Spencer, and Tóth, 281-283 [Zbl 1060.05051]












This page was built for publication: Towards a Theory of Geometric Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4833537)