Approximating the crossing number of graphs embeddable in any orientable surface
From MaRDI portal
Recommendations
Cited in
(21)- The crossing number of a projective graph is quadratic in the face-width
- Crossing numbers and stress of random graphs
- Drawings of graphs on surfaces with few crossings
- Crossing number for graphs with bounded pathwidth
- Exact crossing number parameterized by vertex cover
- Toroidal grid minors and stretch in embedded graphs
- Inapproximability ratios for crossing number
- Crossing numbers of graph embedding pairs on closed surfaces
- Number of embeddings of wheel graphs on surfaces of small genus.
- The crossing number of a projective graph is quadratic in the face–width
- Approximation algorithms for Euler genus and related problems
- scientific article; zbMATH DE number 7278018 (Why is no real title available?)
- Approximating the Crossing Number of Toroidal Graphs
- An algorithm for the graph crossing number problem
- Crossing numbers of beyond-planar graphs
- Inserting an edge into a geometric embedding
- Crossing numbers of beyond-planar graphs
- Inserting Multiple Edges into a Planar Graph
- Vertex insertion approximates the crossing number of apex graphs
- Parameterized algorithms for beyond-planar crossing numbers
- Universality and asymptotics of graph counting problems in non-orientable surfaces
This page was built for publication: Approximating the crossing number of graphs embeddable in any orientable surface
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417677)
