Improvement on the crossing number of crossing-critical graphs
From MaRDI portal
(Redirected from Publication:2117357)
Recommendations
Cites work
- Bounded degree conjecture holds precisely for c-crossing-critical graphs with c 12
- Characterizing 2-crossing-critical graphs
- Crossing numbers of graphs
- Minimal graphs with crossing number at least \(k\)
- Nearly light cycles in embedded graphs and crossing-critical graphs
- On a crossing number result of Richter and Thomassen
- On the decay of crossing numbers
- On topological graphs with at most four crossings per edge
Cited in
(8)- Making a graph crossing-critical by multiplying its edges
- A note on the crossing number of the cone of a graph
- New upper bounds for the crossing numbers of crossing-critical graphs
- Improved upper bounds on the crossing number
- scientific article; zbMATH DE number 25798 (Why is no real title available?)
- Improving the crossing lemma by finding more crossings in sparse graphs
- Improvement on the crossing number of crossing-critical graphs
- Crossing-critical graphs with large maximum degree
This page was built for publication: Improvement on the crossing number of crossing-critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117357)