On geometric graphs with no \(k\) pairwise parallel edges
From MaRDI portal
Publication:1389246
DOI10.1007/PL00009364zbMath0908.05035OpenAlexW1966860149MaRDI QIDQ1389246
Publication date: 18 March 1999
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009364
Related Items (22)
Geometric graphs with no self-intersecting path of length three ⋮ Extremal problems for pairs of triangles ⋮ Turán-type results for partial orders and intersection graphs of convex sets ⋮ A note on light geometric graphs ⋮ k-Quasi-Planar Graphs ⋮ On the light side of geometric graphs ⋮ Ball polytopes and the Vázsonyi problem ⋮ Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane ⋮ Quasiplanar graphs, string graphs, and the Erdős-Gallai problem ⋮ New bounds on the maximum number of edges in \(k\)-quasi-planar graphs ⋮ Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs ⋮ Linear algebra approach to geometric graphs ⋮ A new proof of Vázsonyi's conjecture ⋮ Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar ⋮ Geometric graphs with no two parallel edges ⋮ On-line approach to off-line coloring problems on graphs with geometric representations ⋮ Planar point sets determine many pairwise crossing segments ⋮ The maximum number of edges in geometric graphs with pairwise virtually avoiding edges ⋮ Extremal problems for colored trees and Davenport-Schinzel sequences ⋮ Quasi-planar Graphs ⋮ 2-Layer k-Planar Graphs ⋮ Fan-planarity: properties and complexity
This page was built for publication: On geometric graphs with no \(k\) pairwise parallel edges
