Geometric graphs with few disjoint edges
From MaRDI portal
Publication:1809516
DOI10.1007/PL00009482zbMATH Open0939.68097MaRDI QIDQ1809516FDOQ1809516
Authors: Géza Tóth, Pavel Valtr 
Publication date: 27 June 2000
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (19)
- Title not available (Why is that?)
- A bipartite analogue of Dilworth's theorem
- Some geometric applications of Dilworth's theorem
- On disjoint crossing families in geometric graphs
- Generalized thrackles and geometric graphs in \({\mathbb{R}}^3\) with no pair of strongly avoiding edges
- Construction of locally plane graphs with many edges
- Geometric graphs with no two parallel edges
- On disjoint crossing families in geometric graphs
- Note on geometric graphs
- Packing plane spanning trees and paths in complete geometric graphs
- The beginnings of geometric graph theory
- On the chromatic number of some geometric type Kneser graphs
- On convex geometric graphs with no \(k+1\) pairwise disjoint edges
- Disjoint edges in geometric graphs
- Geometric graphs with no three disjoint edges
- Disjoint edges in geometric graphs
- A note on light geometric graphs
- On the light side of geometric graphs
- On the intersection of edges of a geometric graph by straight lines
This page was built for publication: Geometric graphs with few disjoint edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1809516)
