Which crossing number is it anyway?
From MaRDI portal
Publication:1850498
DOI10.1006/JCTB.2000.1978zbMATH Open1023.05042OpenAlexW2003689202WikidataQ56853080 ScholiaQ56853080MaRDI QIDQ1850498FDOQ1850498
Authors: János Pach, Géza Tóth 
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
Recommendations
Cites Work
- Graph theory
- Bounds for rectilinear crossing numbers
- Some simplified NP-complete graph problems
- Graphs drawn with few crossings per edge
- Crossing Number is NP-Complete
- Crossing-Free Subgraphs
- Title not available (Why is that?)
- On Conway's thrackle conjecture
- A framework for solving VLSI graph layout problems
- New lower bound techniques for VLSI
- Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some provably hard crossing number problems
- Toward a theory of crossing numbers
- Bounds for generalized thrackles
- Über wesentlich unplättbare Kurven im dreidimensionalen Raume
- Title not available (Why is that?)
- An upper bound for the rectilinear crossing number of the complete graph
- New results on rectilinear crossing numbers and plane embeddings
Cited In (53)
- A New Approach to Exact Crossing Minimization
- On the maximum crossing number
- On the decay of crossing numbers of sparse graphs
- A bipartite strengthening of the crossing Lemma
- Crossing numbers of graphs with rotation systems
- The Crossing Number of Graphs: Theory and Computation
- Characterisations and examples of graph classes with bounded expansion
- Hanani-Tutte and monotone drawings
- Relaxing the constraints of clustered planarity
- Removing even crossings
- Link crossing number is NP-hard
- Towards the Hanani-Tutte theorem for clustered graphs
- Crossing Numbers and Parameterized Complexity
- Graph Drawing
- An upper bound on the sum of powers of the degrees of simple 1-planar graphs
- Approximating the maximum rectilinear crossing number
- Mathematical Foundations of Computer Science 2004
- Crossing number, pair-crossing number, and expansion
- Drawing Shortest Paths in Geodetic Graphs
- On the crossing number of complete graphs
- A Bipartite Strengthening of the Crossing Lemma
- A separator theorem for string graphs and its applications
- Near-optimal separators in string graphs
- Drawing Shortest Paths in Geodetic Graphs
- Crossing lemma for the odd-crossing number
- Clustered planarity testing revisited
- Treewidth, Circle Graphs, and Circular Drawings
- On hardness of the joint crossing number
- Odd crossing number and crossing number are not the same
- Crossing number is hard for kernelization
- Removing even crossings on surfaces
- The effect of planarization on width
- Monotone Crossing Number
- On the parity of crossing numbers
- Adjacent Crossings Do Matter
- On disjoint crossing families in geometric graphs
- Parameterized analysis and crossing minimization problems
- Unified Hanani-Tutte theorem
- Crossing Number of Graphs with Rotation Systems
- Removing Even Crossings on Surfaces
- On the degenerate crossing number
- An optimality criterion for the crossing number
- Decidability of string graphs
- Crossing number is hard for cubic graphs
- Simple realizability of complete abstract topological graphs simplified
- Adjacent crossings do matter
- Note on the pair-crossing number and the odd-crossing number
- Crossing Number is NP-Complete
- On plane subgraphs of complete topological drawings
- Crossing numbers of random graphs
- Parameterised partially-predrawn crossing number
- Title not available (Why is that?)
- Recognizing string graphs in NP
This page was built for publication: Which crossing number is it anyway?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850498)
