DMTCS Proceedings, 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)

Font Size:  Small  Medium  Large

Minor-monotone crossing number

Drago Bokal, Gašper Fijavž, Bojan Mohar


The minor crossing number of a graph G, mcr(G), is defined as the minimum crossing number of all graphs that contain G as a minor. We present some basic properties of this new minor-monotone graph invariant. We give estimates on mcr for some important graph families using the topological structure of graphs satisfying mcr(G) ≤k.

Full Text: GZIP Compressed PostScript PostScript PDF original HTML abstract page

Valid XHTML 1.0 Transitional