General lower bounds for the minor crossing number of graphsBokal, Drago (Avtor) Czabarka, Éva (Avtor) Székely, László (Avtor) Vrt'o, Imrich (Avtor) teorija grafovprekrižno številominorhiper kockegraph theoryminor crossing numbergraph minorstring graphshypercubesThere are three general lower bound techniques for the crossing numbers of graphs: the Crossing Lemma, the bisection method and the embedding method. Inthis contribution, we present their adaptations to the minor crossing number. Using the adapted bounds, we improve on the known bounds on the minor crossing number of hypercubes. We also point out relations of the minor crossing number to string graphs.20082015-07-10 15:02:46Delo ni kategorizirano51676sl