Recommendations
- Minor-monotone crossing number
- The minor crossing number of graphs with an excluded minor
- Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree
- General lower bounds for the minor crossing number of graphs
- Improved upper bounds on the crossing number
Cited in
(22)- Hardness of approximation for crossing number
- Toroidal grid minors and stretch in embedded graphs
- Planar decompositions and the crossing number of graphs with an excluded minor
- \(K_7\)-minors in optimal 1-planar graphs
- Crossing number additivity over edge cuts
- Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree
- Stars and bonds in crossing-critical graphs
- Graph minors and the crossing number of graphs
- ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS
- The genus crossing number
- Minor-monotone crossing number
- Crossing and Weighted Crossing Number of Near-Planar Graphs
- Deciding Parity of Graph Crossing Number
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- Minimum degree and graph minors
- Stars and Bonds in Crossing-Critical Graphs
- Approximating the Crossing Number of Toroidal Graphs
- Algorithms for the Hypergraph and the Minor Crossing Number Problems
- Turán's brick factory problem: the status of the conjectures of Zarankiewicz and Hill
- General lower bounds for the minor crossing number of graphs
- Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
- Pair crossing number, cutwidth, and good drawings on arbitrary point sets
This page was built for publication: The Minor Crossing Number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3440260)
