Planar crossing numbers of graphs of bounded genus

DOI10.1007/S00454-012-9430-8zbMATH Open1248.05044OpenAlexW2041021602MaRDI QIDQ452001FDOQ452001

Hristo N. Djidjev, Imrich Vrt'o

Publication date: 19 September 2012

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-012-9430-8

zbMATH Keywords

genuscrossing numberorientable surfacesurface crossing number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Improving the crossing lemma by finding more crossings in sparse graphs
• Crossing Number is NP-Complete
• Crossing-Free Subgraphs
• Crossing number is hard for cubic graphs
• Edge separators for graphs of bounded genus with applications
• On VLSI layouts of the star graph and related networks
• Graph Drawing
• Crossing Numbers and Cutwidths
• Applications of the crossing number
• On a problem of P. Turan concerning graphs
• The crossing number ofCm �Cn is as conjectured forn ?m(m + 1)
• Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas
• Partitioning planar graphs with vertex costs: Algorithms and applications
• Algorithms for the fixed linear crossing number problem
• Computing crossing numbers in quadratic time
• Planarizing graphs---a survey and annotated bibliography
• A New Approach to Exact Crossing Minimization
• Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
• Planar Crossing Numbers of Genus g Graphs
• An algorithm for the graph crossing number problem
• PLANAR CROSSING NUMBERS OF GRAPHS EMBEDDABLE IN ANOTHER SURFACE

Cited In (6)

• Planar decompositions and the crossing number of graphs with an excluded minor
• Toroidal grid minors and stretch in embedded graphs
• Crossing numbers of beyond-planar graphs
• Improved product structure for graphs on surfaces
• Drawings of graphs on surfaces with few crossings
• New bounds on crossing numbers

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)