Discrete and Computational Geometry

DOI10.1007/b11261zbMath1179.05036OpenAlexW62175113MaRDI QIDQ5897106

János Pach, Radoš Radoičić, Géza Tóth

Publication date: 5 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11261

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (17)

Drawing Graphs with Right Angle Crossings ⋮ On the maximum number of edges in quasi-planar graphs ⋮ On the recognition of fan-planar and maximal outer-fan-planar graphs ⋮ k-Quasi-Planar Graphs ⋮ Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane ⋮ Quasiplanar graphs, string graphs, and the Erdős-Gallai problem ⋮ String graphs and incomparability graphs ⋮ Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar ⋮ Unnamed Item ⋮ Drawing graphs with right angle crossings ⋮ On edges crossing few other edges in simple topological complete graphs ⋮ On the maximum number of edges in topological graphs with no four pairwise crossing edges ⋮ Twenty years of progress of \(\mathrm{JCDCG}^3\) ⋮ Quasi-planar Graphs ⋮ Topological graphs with no large grids ⋮ 2-Layer k-Planar Graphs ⋮ On the Number of Edges of Fan-Crossing Free Graphs

This page was built for publication: Discrete and Computational Geometry