Which crossing number is it anyway?
From MaRDI portal
Publication:1850498
DOI10.1006/jctb.2000.1978zbMath1023.05042OpenAlexW2003689202WikidataQ56853080 ScholiaQ56853080MaRDI QIDQ1850498
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.2000.1978
Related Items (40)
Crossing number, pair-crossing number, and expansion ⋮ Drawing Shortest Paths in Geodetic Graphs ⋮ Crossing numbers of random graphs ⋮ Decidability of string graphs ⋮ On the Decay of Crossing Numbers of Sparse Graphs ⋮ Unified Hanani-Tutte theorem ⋮ Parameterized analysis and crossing minimization problems ⋮ Towards the Hanani-Tutte Theorem for Clustered Graphs ⋮ Removing even crossings ⋮ Monotone Crossing Number ⋮ Simple realizability of complete abstract topological graphs simplified ⋮ Removing Even Crossings on Surfaces ⋮ Clustered planarity testing revisited ⋮ Treewidth, Circle Graphs, and Circular Drawings ⋮ On the degenerate crossing number ⋮ An upper bound on the sum of powers of the degrees of simple 1-planar graphs ⋮ The Effect of Planarization on Width ⋮ A New Approach to Exact Crossing Minimization ⋮ Characterisations and examples of graph classes with bounded expansion ⋮ Note on the pair-crossing number and the odd-crossing number ⋮ On plane subgraphs of complete topological drawings ⋮ Near-Optimal Separators in String Graphs ⋮ Odd crossing number and crossing number are not the same ⋮ A bipartite strengthening of the crossing Lemma ⋮ Relaxing the constraints of clustered planarity ⋮ Crossing numbers of graphs with rotation systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Separator Theorem for String Graphs and its Applications ⋮ Recognizing string graphs in NP ⋮ A Bipartite Strengthening of the Crossing Lemma ⋮ Crossing Numbers and Parameterized Complexity ⋮ Adjacent Crossings Do Matter ⋮ Approximating the Maximum Rectilinear Crossing Number ⋮ The Crossing Number of Graphs: Theory and Computation ⋮ Hanani-Tutte and Monotone Drawings ⋮ Removing even crossings on surfaces ⋮ Crossing lemma for the odd-crossing number ⋮ Drawing Shortest Paths in Geodetic Graphs ⋮ On the crossing number of complete graphs
Cites Work
- A framework for solving VLSI graph layout problems
- Some provably hard crossing number problems
- Some simplified NP-complete graph problems
- Graphs drawn with few crossings per edge
- On Conway's thrackle conjecture
- Bounds for generalized thrackles
- An upper bound for the rectilinear crossing number of the complete graph
- Crossing Number is NP-Complete
- New lower bound techniques for VLSI
- Crossing-Free Subgraphs
- New results on rectilinear crossing numbers and plane embeddings
- Bounds for rectilinear crossing numbers
- Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
- Über wesentlich unplättbare Kurven im dreidimensionalen Raume
- Toward a theory of crossing numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Which crossing number is it anyway?
