Many disjoint edges in topological graphs
From MaRDI portal
Publication:5919826
DOI10.1016/j.comgeo.2016.11.003zbMath1365.05210OpenAlexW1813069087MaRDI QIDQ5919826
Publication date: 29 June 2017
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2016.11.003
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (5)
Unavoidable patterns in complete simple topological graphs ⋮ Shooting stars in simple drawings of \(K_{m,n}\) ⋮ Twisted ways to find plane structures in simple drawings of complete graphs ⋮ Unnamed Item ⋮ On plane subgraphs of complete topological drawings
Cites Work
- Unnamed Item
- Unnamed Item
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- Disjoint edges in topological graphs
- Ramsey-type theorems
- Density theorems for bipartite graphs and related Ramsey-type results
- Optimal packing and covering in the plane are NP-complete
- Label placement by maximum independent set in rectangles
- Unavoidable configurations in complete topological graphs
- Quasi-optimal range searching in spaces of finite VC-dimension
- Research Problems in Discrete Geometry
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- Approximation schemes for covering and packing problems in image processing and VLSI
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Estimating the Number of Disjoint Edges in Simple Topological Graphs via Cylindrical Drawings
- Topological graphs
- Disjoint edges in complete topological graphs
This page was built for publication: Many disjoint edges in topological graphs