Geometric graphs with no two parallel edges

DOI10.1007/s00493-008-2250-zzbMath1164.05015OpenAlexW2025538992MaRDI QIDQ949787

Rom Pinchasi

Publication date: 21 October 2008

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-008-2250-z

zbMATH Keywords

geometric graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (3)

Ball polytopes and the Vázsonyi problem ⋮ Planar point sets determine many pairwise crossing segments ⋮ The maximum number of edges in geometric graphs with pairwise virtually avoiding edges

Cites Work

• On Conway's thrackle conjecture
• On geometric graphs with no two edges in convex position
• On geometric graphs with no \(k\) pairwise parallel edges
• Bounds for generalized thrackles
• Unnamed Item

This page was built for publication: Geometric graphs with no two parallel edges