 |
Discrete Mathematics & Theoretical Computer Science |
Drago Bokal ; Gašper Fijavž ; Bojan Mohar - Minor-monotone crossing number
dmtcs:3433 - Discrete Mathematics & Theoretical Computer Science, January 1, 2005, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) - https://doi.org/10.46298/dmtcs.3433Minor-monotone crossing numberArticle
- 1 Institute of Mathematics, Physics and Mechanics [Ljubljana]
- 2 Faculty of Computer and Information Science [Ljubljana]
- 3 Department of Mathematics
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$.
Source: HAL:hal-01184390v1
Volume: DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
Section: Proceedings
Published on: January 1, 2005
Imported on: May 10, 2017
Keywords: crossing number,graph minor,minor-monotone graph parameter,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]
2 Documents citing this article
Consultation statistics
This page has been seen 195 times.
This article's PDF has been downloaded 394 times.