The Minor Crossing Number
From MaRDI portal
Publication:3440260
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
(21)- Planar decompositions and the crossing number of graphs with an excluded minor
- Toroidal grid minors and stretch in embedded graphs
- \(K_7\)-minors in optimal 1-planar graphs
- Deciding Parity of Graph Crossing Number
- Stars and bonds in crossing-critical graphs
- Turán's brick factory problem: the status of the conjectures of Zarankiewicz and Hill
- Minimum degree and graph minors
- The genus crossing number
- ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS
- Minor-monotone crossing number
- Approximating the Crossing Number of Toroidal Graphs
- General lower bounds for the minor crossing number of graphs
- Crossing number additivity over edge cuts
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- Hardness of approximation for crossing number
- Stars and Bonds in Crossing-Critical Graphs
- Crossing and Weighted Crossing Number of Near-Planar Graphs
- Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree
- Algorithms for the Hypergraph and the Minor Crossing Number Problems
- Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
- Graph minors and the crossing number of graphs
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)