Minor-monotone crossing number - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Minor-monotone crossing number

Abstract

The minor crossing number of a graph $G$, $rmmcr(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 mmcr for some important graph families using the topological structure of graphs satisfying \$mcr(G) ≤k$.
Fichier principal
Vignette du fichier
dmAE0124.pdf (152.9 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184390 , version 1 (14-08-2015)

Identifiers

Cite

Drago Bokal, Gašper Fijavž, Bojan Mohar. Minor-monotone crossing number. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.123-128, ⟨10.46298/dmtcs.3433⟩. ⟨hal-01184390⟩

Collections

INSMI TDS-MACS
44 View
571 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More