Title of article
Graph minors and the crossing number of graphs
Author/Authors
Drago Bokal، نويسنده , , Drago and Czabarka، نويسنده , , ةva and Székely، نويسنده , , Lلszlَ A. and Vrtʹo، نويسنده , , Imrich، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
7
From page
169
To page
175
Abstract
There are three general lower bound techniques for the crossing numbers of graphs, all of which can be traced back to Leightonʹs work on applications of crossing number in VLSI: the Crossing Lemma, the Bisection Method, and the Embedding Method. In this contribution, we sketch their adaptations to the minor crossing number.
Keywords
minor crossing number , graph minor , crossing number
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2007
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454562
Link To Document