Making a graph crossing-critical by multiplying its edges

Details Making a graph crossing-critical by multiplying its edges Making a graph crossing-critical by multiplying its edges

2011-12-14

arxiv.org/abs/1112.3167v3

Mathematics

Combinatorics

12 pages - last proof updated

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Making a graph crossing-critical by multiplying its edges does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Making a graph crossing-critical by multiplying its edges, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Making a graph crossing-critical by multiplying its edges will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-226060