Tight Upper Bounds on the Crossing Number in a Minor-Closed Class
From MaRDI portal
Publication:6304845
DOI10.1145/1377676.1377739zbMath1271.05027arXiv1807.11617MaRDI QIDQ6304845
Ken-ichi Kawarabayashi, David R. Wood, Vida Dujmović, Bojan Mohar
Publication date: 30 July 2018
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83)
This page was built for publication: Tight Upper Bounds on the Crossing Number in a Minor-Closed Class