On the crossing number of almost planar graphs
From MaRDI portal
Publication:3418609
zbMATH Open1107.68068MaRDI QIDQ3418609FDOQ3418609
Publication date: 5 February 2007
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cited In (19)
- Crossing numbers of graph embedding pairs on closed surfaces
- A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
- Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
- The Alon-Tarsi number of planar graphs
- Crossing numbers of beyond-planar graphs
- Crossing number and weighted crossing number of near-planar graphs
- Title not available (Why is that?)
- A successful concept for measuring non-planarity of graphs: The crossing number.
- Approximating the Crossing Number of Toroidal Graphs
- Title not available (Why is that?)
- Configurations with few crossings in topological graphs
- On the crossing number of complete graphs
- \(k\)-planar crossing number of random graphs and random regular graphs
- On crossing numbers of geometric proximity graphs
- On the Size of Planarly Connected Crossing Graphs
- On the Crossing Number of Almost Planar Graphs
- Crossing and Weighted Crossing Number of Near-Planar Graphs
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
- Crossing Numbers of Beyond-Planar Graphs Revisited
This page was built for publication: On the crossing number of almost planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3418609)