Planar crossing numbers of graphs of bounded genus
From MaRDI portal
(Redirected from Publication:452001)
Recommendations
Cites work
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 5485473 (Why is no real title available?)
- scientific article; zbMATH DE number 1054768 (Why is no real title available?)
- A New Approach to Exact Crossing Minimization
- Algorithms for the fixed linear crossing number problem
- An algorithm for the graph crossing number problem
- Applications of the crossing number
- Computing crossing numbers in quadratic time
- Crossing Number is NP-Complete
- Crossing Numbers and Cutwidths
- Crossing number is hard for cubic graphs
- Crossing-Free Subgraphs
- Edge separators for graphs of bounded genus with applications
- Graph Drawing
- Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas
- Improving the crossing lemma by finding more crossings in sparse graphs
- On VLSI layouts of the star graph and related networks
- On a problem of P. Turan concerning graphs
- PLANAR CROSSING NUMBERS OF GRAPHS EMBEDDABLE IN ANOTHER SURFACE
- Partitioning planar graphs with vertex costs: Algorithms and applications
- Planar Crossing Numbers of Genus g Graphs
- Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
- Planarizing graphs---a survey and annotated bibliography
- Survey of the crossing number of graphs
- The crossing number ofCm �Cn is as conjectured forn ?m(m + 1)
Cited in
(18)- Planar decompositions and the crossing number of graphs with an excluded minor
- Polylogarithmic approximation for Euler genus on bounded degree graphs
- Toroidal grid minors and stretch in embedded graphs
- Improved bounds for the crossing numbers on surfaces of genus g
- Planar Crossing Numbers of Genus g Graphs
- Planarization of graphs embedded on surfaces
- Crossing numbers of beyond-planar graphs
- The genus crossing number
- Drawings of graphs on surfaces with few crossings
- Genus, treewidth, and local crossing number
- Improved product structure for graphs on surfaces
- The crossing number of a projective graph is quadratic in the face–width
- PLANAR CROSSING NUMBERS OF GRAPHS EMBEDDABLE IN ANOTHER SURFACE
- Graph Drawing
- Structure of graphs with locally restricted crossings
- The degenerate crossing number and higher-genus embeddings
- New bounds on crossing numbers
- The crossing number of a projective graph is quadratic in the face-width
This page was built for publication: Planar crossing numbers of graphs of bounded genus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452001)