The following pages link to The Minor Crossing Number (Q3440260):
Displaying 18 items.
- Hardness of approximation for crossing number (Q1943651) (← links)
- Toroidal grid minors and stretch in embedded graphs (Q2284733) (← links)
- Planar decompositions and the crossing number of graphs with an excluded minor (Q2373925) (← links)
- \(K_7\)-minors in optimal 1-planar graphs (Q2400554) (← links)
- Crossing number additivity over edge cuts (Q2444731) (← links)
- Stars and bonds in crossing-critical graphs (Q3069675) (← links)
- Graph minors and the crossing number of graphs (Q3439581) (← links)
- ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS (Q3542458) (← links)
- Crossing and Weighted Crossing Number of Near-Planar Graphs (Q3611835) (← links)
- Deciding Parity of Graph Crossing Number (Q4578013) (← links)
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph (Q4908829) (← links)
- Minimum Degree and Graph Minors (Q5300986) (← links)
- Stars and Bonds in Crossing-Critical Graphs (Q5301022) (← links)
- Approximating the Crossing Number of Toroidal Graphs (Q5387753) (← links)
- Algorithms for the Hypergraph and the Minor Crossing Number Problems (Q5387756) (← links)
- Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill (Q5506784) (← links)
- General lower bounds for the minor crossing number of graphs (Q5962348) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
