General lower bounds for the minor crossing number of graphs

Drago Bokal (Avtor), Éva Czabarka (Avtor), László Székely (Avtor), Imrich Vrt'o (Avtor)

Povzetek

There 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.

Ključne besede

teorija grafov;prekrižno število;minor;hiper kocke;graph theory;minor crossing number;graph minor;string graphs;hypercubes;

Podatki

Jezik:	Angleški jezik
Leto izida:	2008
Tipologija:	0 - Ni določena
Organizacija:	UM FNM - Fakulteta za naravoslovje in matematiko
UDK:	519.17
COBISS:	14795353
ISSN:	1318-4865
Št. ogledov:	0
Št. prenosov:	0
Ocena:	0 (0 glasov)
Metapodatki:

Ostali podatki

Sekundarni jezik:	Neznan jezik
URN:	URN:SI:UM:
Vrsta dela (COBISS):	Delo ni kategorizirano
Strani:	str. 1-15
Letnik:	ǂVol. ǂ46
Zvezek:	ǂšt. ǂ1054
Čas izdaje:	2008
ID:	1473613