Disjoint edges in geometric graphs
From MaRDI portal
Publication:5893809
Recommendations
- Disjoint edges in geometric graphs
- Combinatorial Geometry and Graph Theory
- Disjoint edges in topological graphs
- Geometric graphs with few disjoint edges
- Disjoint edges in separated hypergraphs
- Disjoint edges in complete topological graphs
- Disjoint edges in complete topological graphs
- Disjointness graphs of segments
- Geometric graphs with no three disjoint edges
- scientific article; zbMATH DE number 426342
Cites work
Cited in
(20)- Almost disjoint triangles in 3-space
- Crossing numbers of beyond-planar graphs
- Intersection number of two connected geometric graphs
- Some geometric applications of Dilworth's theorem
- A Turán-type theorem on chords of a convex polygon
- Crossing families
- Applications of the crossing number
- Disjoint edges in complete topological graphs
- Disjoint compatible geometric matchings
- Disjoint compatible geometric matchings
- A long noncrossing path among disjoint segments in the plane
- Geometric graphs with no two parallel edges
- Noncrossing monochromatic subtrees and staircases in 0-1 matrices
- Note on geometric graphs
- Nonplanar Graph Drawings with k Vertices per Face
- On convex geometric graphs with no \(k+1\) pairwise disjoint edges
- Geometric graphs with no three disjoint edges
- Beyond-planarity: Turán-type results for non-planar bipartite graphs
- scientific article; zbMATH DE number 3896968 (Why is no real title available?)
- Disjoint edges in geometric graphs
This page was built for publication: Disjoint edges in geometric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5893809)
