The graph crossing number and its variants: a survey
From MaRDI portal
Publication:1953539
zbMath1267.05180MaRDI QIDQ1953539
Publication date: 7 June 2013
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/DS21
Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (59)
On the rectilinear crossing number of complete uniform hypergraphs ⋮ The rectilinear local crossing number of \(K_{n}\) ⋮ A faster fixed parameter algorithm for two-layer crossing minimization ⋮ On the Maximum Number of Crossings in Star-Simple Drawings of $K_n$ with No Empty Lens ⋮ Hanani--Tutte and Hierarchical Partial Planarity ⋮ The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph ⋮ Edge-minimum saturated \(k\)-planar drawings ⋮ Approximating the bundled crossing number ⋮ The crossing number of twisted graphs ⋮ There are no cubic graphs on 26 vertices with crossing number 10 or 11 ⋮ The slotted online one-sided crossing minimization problem on 2-regular graphs ⋮ The outerplanar crossing number of the complete bipartite graph ⋮ Properties of Large 2-Crossing-Critical Graphs ⋮ Parameterized analysis and crossing minimization problems ⋮ Deciding Parity of Graph Crossing Number ⋮ Crossings between non-homotopic edges ⋮ Structure of Graphs with Locally Restricted Crossings ⋮ From art and circuit design to geometry and combinatorics ⋮ Crossing edge minimization in radial outerplanar layered graphs using segment paths ⋮ A crossing lemma for multigraphs ⋮ Simple realizability of complete abstract topological graphs simplified ⋮ Shortest path embeddings of graphs on surfaces ⋮ Approximating the Bundled Crossing Number ⋮ Inserting Multiple Edges into a Planar Graph ⋮ Maximum rectilinear crossing number of uniform hypergraphs ⋮ Compatible spanning trees in simple drawings of \(K_n\) ⋮ The crossing numbers of join products of four graphs of order five with paths and cycles ⋮ The Bundled Crossing Number ⋮ Approximating the Rectilinear Crossing Number ⋮ Note on \(k\)-planar crossing numbers ⋮ Treewidth, Circle Graphs, and Circular Drawings ⋮ Link crossing number is NP-hard ⋮ An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants ⋮ Bundled crossings revisited ⋮ On the 2-colored crossing number ⋮ On the Pseudolinear Crossing Number ⋮ Beyond Outerplanarity ⋮ Bundled Crossings Revisited ⋮ Complexity of Geometric k-Planarity for Fixed k ⋮ Orthogonal Tree Decompositions of Graphs ⋮ On plane subgraphs of complete topological drawings ⋮ Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) ⋮ Unnamed Item ⋮ Shellable drawings and the cylindrical crossing number of \(K_n\) ⋮ Crossing numbers of beyond-planar graphs ⋮ The conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz's conjecture holds ⋮ A survey of graphs with known or bounded crossing numbers ⋮ Approximating the Maximum Rectilinear Crossing Number ⋮ The bipartite-cylindrical crossing number of the complete bipartite graph ⋮ Connecting the dots (with minimum crossings) ⋮ Unnamed Item ⋮ Weighted Turán problems with applications ⋮ Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill ⋮ Crossings Between Non-homotopic Edges ⋮ Simple Topological Drawings of k-Planar Graphs ⋮ Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$ ⋮ Fan-planarity: properties and complexity ⋮ The Degenerate Crossing Number and Higher-Genus Embeddings ⋮ A crossing lemma for multigraphs
This page was built for publication: The graph crossing number and its variants: a survey
