On geometric graphs with no two edges in convex position

DOI10.1007/PL00009357zbMath0908.05033MaRDI QIDQ1387850

Meir Katchalski, Hagit Last

Publication date: 8 June 1998

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

convex positiongeometric graphplanar drawing

Mathematics Subject Classification ID

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

Related Items (9)

A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem ⋮ A note on light geometric graphs ⋮ Ball polytopes and the Vázsonyi problem ⋮ Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind ⋮ Linear algebra approach to geometric graphs ⋮ A new proof of Vázsonyi's conjecture ⋮ Geometric graphs with no two parallel edges ⋮ Planar point sets determine many pairwise crossing segments ⋮ The maximum number of edges in geometric graphs with pairwise virtually avoiding edges

This page was built for publication: On geometric graphs with no two edges in convex position