On snarks that are far from being 3-edge colorable

Details On snarks that are far from being 3-edge colorable On snarks that are far from being 3-edge colorable

2012-03-09

arxiv.org/abs/1203.2015v1

Mathematics

Combinatorics

10 pages, 7 figures

Scientific paper

In this note we construct two infinite snark families which have high oddness and low circumference compared to the number of vertices. Using this construction, we also give a counterexample to a suggested strengthening of Fulkerson's conjecture by showing that the Petersen graph is not the only cyclically 4-edge connected cubic graph which require at least five perfect matchings to cover its edges. Furthermore the counterexample presented has the interesting property that no 2-factor can be part of a cycle double cover.

Affiliated with

Also associated with

No associations

Rating

On snarks that are far from being 3-edge colorable 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 On snarks that are far from being 3-edge colorable, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On snarks that are far from being 3-edge colorable will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-302003