Geometric graphs with no three disjoint edges

DOI10.1007/s00454-005-1191-1zbMath1081.05078OpenAlexW2010965904MaRDI QIDQ816998

Jakub Černý

Publication date: 2 March 2006

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

Full work available at URL: https://doi.org/10.1007/s00454-005-1191-1

zbMATH Keywords

pointsstraight line segments

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (5)

Packing plane spanning trees and paths in complete geometric graphs ⋮ On convex geometric graphs with no \(k+1\) pairwise disjoint edges ⋮ Disjoint edges in geometric graphs ⋮ On edges crossing few other edges in simple topological complete graphs ⋮ Achromatic numbers of Kneser graphs

This page was built for publication: Geometric graphs with no three disjoint edges