Odd crossing number and crossing number are not the same
From MaRDI portal
Publication:2482214
DOI10.1007/s00454-008-9058-xzbMath1143.05021OpenAlexW2092577467WikidataQ114229318 ScholiaQ114229318MaRDI QIDQ2482214
Marcus Schaefer, Michael J. Pelsmajer, Daniel Štefanković
Publication date: 16 April 2008
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-008-9058-x
Related Items (11)
Monotone Crossing Number ⋮ Bounding the tripartite‐circle crossing number of complete tripartite graphs ⋮ On the degenerate crossing number ⋮ On the Pseudolinear Crossing Number ⋮ Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) ⋮ Crossing numbers of graphs with rotation systems ⋮ Adjacent Crossings Do Matter ⋮ The bipartite-cylindrical crossing number of the complete bipartite graph ⋮ The Crossing Number of Graphs: Theory and Computation ⋮ Hanani-Tutte and Monotone Drawings ⋮ Crossing lemma for the odd-crossing number
Cites Work
- A successful concept for measuring non-planarity of graphs: The crossing number.
- Which crossing number is it anyway?
- Crossing number, pair-crossing number, and expansion
- Crossing Number is NP-Complete
- Ü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: Odd crossing number and crossing number are not the same