Geometric graphs with few disjoint edges
From MaRDI portal
Publication:1809516
DOI10.1007/PL00009482zbMath0939.68097MaRDI QIDQ1809516
Publication date: 27 June 2000
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (8)
Packing plane spanning trees and paths in complete geometric graphs ⋮ On the chromatic number of some geometric type Kneser graphs ⋮ A bipartite analogue of Dilworth's theorem ⋮ On the light side of geometric graphs ⋮ Note on geometric graphs ⋮ On convex geometric graphs with no \(k+1\) pairwise disjoint edges ⋮ Disjoint edges in geometric graphs ⋮ Unnamed Item
This page was built for publication: Geometric graphs with few disjoint edges
