Geometric graphs with no two parallel edges

DOI10.1007/S00493-008-2250-ZzbMATH Open1164.05015OpenAlexW2025538992MaRDI QIDQ949787FDOQ949787

Authors: 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

Recommendations

• Geometric graphs with no three disjoint edges
• On geometric graphs with no \(k\) pairwise parallel edges
• Geometric graphs with few disjoint edges
• On geometric graphs with no two edges in convex position
• Geometric graphs
• scientific article; zbMATH DE number 3979118
• scientific article; zbMATH DE number 3966128
• Publication:4862337
• Disjoint edges in geometric graphs
• Disjoint edges in geometric graphs

zbMATH Keywords

geometric graph

Mathematics Subject Classification ID

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

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
• Title not available (Why is that?)
• Bounds for generalized thrackles

Cited In (6)

• A note on lenses in arrangements of pairwise intersecting circles in the plane
• 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
• On the number of edges in geometric graphs without empty triangles
• A note on light geometric graphs

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

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