Opened Access On making a graph crossing-critical
Cites
Show item statistics
Icon
Export to
Author: Hernández Vélez, César Israel
Leaños Macías, Jesús
Coordinator/Director: Díaz Báñez, José Miguel
Garijo Royo, Delia
Márquez Pérez, Alberto
Urrutia Galicia, Jorge
Date: 2013
Published in: XV Spanish Meeting on Computational Geometry (2013), p 115-118
Document type: Presentation
Abstract: 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.
Size: 854.1Kb
Format: PDF

URI: http://hdl.handle.net/11441/60269

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)