Graph minors and the crossing number of graphs

DOI10.1016/j.endm.2007.01.024zbMath1291.05191OpenAlexW2029134826MaRDI QIDQ3439581

Drago Bokal, Imrich Vrt'o, László A. Székely, Éva Czabarka

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2007.01.024

zbMATH Keywords

graph minorcrossing numberminor crossing number

Mathematics Subject Classification ID

Graph minors (05C83) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Algorithms for the Hypergraph and the Minor Crossing Number Problems

Cites Work

• The crossing number of a graph on a compact 2-manifold
• The Minor Crossing Number
• A Separator Theorem for Planar Graphs
• Crossing-Free Subgraphs
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• Improving the crossing lemma by finding more crossings in sparse graphs
• Crossing Number Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Graph minors and the crossing number of graphs