Making a graph crossing-critical by multiplying its edges
The electronic journal of combinatorics, Tome 20 (2013) no. 1
A graph is crossing-critical if the removal of any of its edges decreases its crossing number. This work is motivated by the following question: to what extent is crossing-criticality a property that is inherent to the structure of a graph, and to what extent can it be induced on a noncritical graph by multiplying (all or some of) its edges? It is shown that if a nonplanar graph $G$ is obtained by adding an edge to a cubic polyhedral graph, and $G$ is sufficiently connected, then $G$ can be made crossing-critical by a suitable multiplication of edges.
DOI :
10.37236/2712
Classification :
05C62, 05C10, 05C22, 05C75
Mots-clés : crossing number, nonplanar graph
Mots-clés : crossing number, nonplanar graph
@article{10_37236_2712,
author = {Laurent Beaudou and C\'esar Hern\'andez-V\'elez and Gelasio Salazar},
title = {Making a graph crossing-critical by multiplying its edges},
journal = {The electronic journal of combinatorics},
year = {2013},
volume = {20},
number = {1},
doi = {10.37236/2712},
zbl = {1266.05101},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2712/}
}
TY - JOUR AU - Laurent Beaudou AU - César Hernández-Vélez AU - Gelasio Salazar TI - Making a graph crossing-critical by multiplying its edges JO - The electronic journal of combinatorics PY - 2013 VL - 20 IS - 1 UR - http://geodesic.mathdoc.fr/articles/10.37236/2712/ DO - 10.37236/2712 ID - 10_37236_2712 ER -
Laurent Beaudou; César Hernández-Vélez; Gelasio Salazar. Making a graph crossing-critical by multiplying its edges. The electronic journal of combinatorics, Tome 20 (2013) no. 1. doi: 10.37236/2712
Cité par Sources :