Crossing Numbers of Graphs

From MaRDI portal
Revision as of 13:01, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4589364

DOI10.1201/9781315152394zbMath1388.05005OpenAlexW2900334066MaRDI QIDQ4589364

Marcus Schaefer

Publication date: 10 November 2017

Full work available at URL: https://doi.org/10.1201/9781315152394





Related Items (34)

Bad drawings of small complete graphsComplete graph drawings up to triangle mutationsThe crossing number of twisted graphsThere are no cubic graphs on 26 vertices with crossing number 10 or 11The outerplanar crossing number of the complete bipartite graphProperties of Large 2-Crossing-Critical GraphsCrossing Numbers of Beyond-Planar Graphs RevisitedParameterized analysis and crossing minimization problemsCrossings between non-homotopic edgesCoboundary expansion, equivariant overlap, and crossing numbers of simplicial complexesDrawings of complete graphs in the projective planeA note on the crossing numbers of 5-regular graphsHanani-Tutte for radial planarity. IIWeak-dynamic coloring of graphs beyond-planarityPlanarizing graphs and their drawings by vertex splittingFinding geometric representations of apex graphs is \textsf{NP}-hardTreewidth, Circle Graphs, and Circular DrawingsCrossing numbers and stress of random graphsOn the \(k\)-planar local crossing numberRotation systems and simple drawings in surfacesTesting gap \(k\)-planarity is NP-completeThe crossing number of Cartesian product of sunlet graph with path and complete bipartite graphOn book crossing numbers of the complete graphTaking a detour; or, Gioan's theorem, and pseudolinear drawings of complete graphsDifferent types of isomorphisms of drawings of complete multipartite graphsThe conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz's conjecture holdsA survey of graphs with known or bounded crossing numbersInserting one edge into a simple drawing is hardA note on the crossing number of the cone of a graphOn Layered Fan-Planar Graph DrawingsQuantitative Restrictions on Crossing PatternsLimiting Crossing Numbers for Geodesic Drawings on the SphereCrossings Between Non-homotopic EdgesImprovement on the crossing number of crossing-critical graphs







This page was built for publication: Crossing Numbers of Graphs