Ponencia
On making a graph crossing-critical
Autor/es | Hernández Vélez, César Israel
Leaños Macías, Jesús |
Coordinador/Director | Díaz Báñez, José Miguel
Garijo Royo, Delia Márquez Pérez, Alberto Urrutia Galicia, Jorge |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada II |
Fecha de publicación | 2013 |
Fecha de depósito | 2017-05-23 |
Publicado en |
|
Resumen | A graph is crossing-critical if its crossing number decreases when we remove any of its edges. Recently it was proved that if a non-planar graph G is obtained by adding an edge to a cubic polyhedral (planar 3-connected) ... A graph is crossing-critical if its crossing number decreases when we remove any of its edges. Recently it was proved that if a non-planar graph G is obtained by adding an edge to a cubic polyhedral (planar 3-connected) graph, then G can be made crossingcritical by a suitable multiplication of its edges. Here we show: (i) a new family of graphs that can be transformed into crossing-critical graphs by a suitable multiplication of its edges, and (ii) a family of graphs that cannot be made crossing-critical by any multiplication of its edges. |
Cita | Hernández Vélez, C.I. y Leaños Macías, J. (2013). On making a graph crossing-critical. En XV Spanish Meeting on Computational Geometry, Sevilla. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
On making a graph crossing-cri ... | 854.1Kb | [PDF] | Ver/ | |