The Minor Crossing Number

DOI10.1137/05062706XzbMath1118.05016OpenAlexW2001442460MaRDI QIDQ3440260

Drago Bokal, Bojan Mohar, Gašper Fijavž

Publication date: 22 May 2007

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/05062706x

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83)

Related Items (17)

Minimum Degree and Graph Minors ⋮ Stars and Bonds in Crossing-Critical Graphs ⋮ \(K_7\)-minors in optimal 1-planar graphs ⋮ Deciding Parity of Graph Crossing Number ⋮ Parameterized algorithms and data reduction for the short secluded s‐t‐path problem ⋮ Hardness of approximation for crossing number ⋮ Crossing number additivity over edge cuts ⋮ Algorithms for the Hypergraph and the Minor Crossing Number Problems ⋮ ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS ⋮ Approximating the Crossing Number of Toroidal Graphs ⋮ Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph ⋮ Toroidal grid minors and stretch in embedded graphs ⋮ Crossing and Weighted Crossing Number of Near-Planar Graphs ⋮ General lower bounds for the minor crossing number of graphs ⋮ Stars and bonds in crossing-critical graphs ⋮ Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill ⋮ Graph minors and the crossing number of graphs

This page was built for publication: The Minor Crossing Number