Improvement on the Decay of Crossing Numbers
DOI10.1007/978-3-540-77537-9_5zbMATH Open1137.68460OpenAlexW2161184678MaRDI QIDQ5452206FDOQ5452206
Authors: Jakub Černý, Jan Kynčl, Géza Tóth
Publication date: 25 March 2008
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_5
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
Cited In (7)
- On the decay of crossing numbers
- On the Decay of Crossing Numbers
- On the decay of crossing numbers of sparse graphs
- Improved upper bounds on the crossing number
- Improvement on the decay of crossing numbers
- Nested cycles in large triangulations and crossing-critical graphs
- The crossing number of \(K_{5,n+1} \setminus e\)
This page was built for publication: Improvement on the Decay of Crossing Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452206)