Configurations with few crossings in topological graphs
DOI10.1016/J.COMGEO.2006.06.001zbMATH Open1117.05029OpenAlexW2161036821MaRDI QIDQ876504FDOQ876504
Authors: Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff 
Publication date: 18 April 2007
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2006.06.001
Recommendations
- Algorithms and Computation
- On topological graphs with at most four crossings per edge
- Graph Drawing
- On edges crossing few other edges in simple topological complete graphs
- Noncrossing Subgraphs in Topological Layouts
- Configuration spaces of graphs
- Structure of graphs with locally restricted crossings
- On the crossing number of almost planar graphs
- On the Crossing Number of Almost Planar Graphs
- scientific article; zbMATH DE number 1792068
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Title not available (Why is that?)
- A Short Proof of the Factor Theorem for Finite Graphs
- The complexity of detecting crossingfree configurations in the plane
- Noncrossing Subgraphs in Topological Layouts
- Reconstructing sets of orthogonal line segments in the plane
- Fundamentals of Computation Theory
- Algorithms and Computation
Cited In (7)
- Crossing Stars in Topological Graphs
- Non-crossing geometric steiner arborescences
- Noncrossing subgraphs in the topological graph \(K_{3,3}\)
- Parameterized analysis and crossing minimization problems
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
- Algorithms and Computation
- Maximum weighted matching with few edge crossings for 2-layered bipartite graph
This page was built for publication: Configurations with few crossings in topological graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876504)
