On the crossing number of almost planar graphs
From MaRDI portal
(Redirected from Publication:3418609)
Recommendations
Cited in
(20)- A successful concept for measuring non-planarity of graphs: The crossing number.
- The Alon-Tarsi number of planar graphs
- \(k\)-planar crossing number of random graphs and random regular graphs
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
- Crossing numbers of graph embedding pairs on closed surfaces
- On the Size of Planarly Connected Crossing Graphs
- scientific article; zbMATH DE number 3646924 (Why is no real title available?)
- A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
- On the Crossing Number of Almost Planar Graphs
- Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
- Crossing and Weighted Crossing Number of Near-Planar Graphs
- scientific article; zbMATH DE number 1792068 (Why is no real title available?)
- scientific article; zbMATH DE number 881174 (Why is no real title available?)
- Crossing Numbers of Beyond-Planar Graphs Revisited
- Approximating the Crossing Number of Toroidal Graphs
- Crossing number and weighted crossing number of near-planar graphs
- Crossing numbers of beyond-planar graphs
- On crossing numbers of geometric proximity graphs
- On the crossing number of complete graphs
- Configurations with few crossings in topological graphs
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)
