Mácajová and Škoviera Conjecture on Cubic Graphs

Details Mácajová and Škoviera Conjecture on Cubic Graphs Mácajová and Škoviera Conjecture on Cubic Graphs

2008-09-28

arxiv.org/abs/0809.4839v2

Discussionnes Mathematicae on Graph Theory 30, 2 (2010) xxx-yyy

Computer Science

Discrete Mathematics

Scientific paper

A conjecture of M\'a\u{c}ajov\'a and \u{S}koviera asserts that every
bridgeless cubic graph has two perfect matchings whose intersection does not
contain any odd edge cut. We prove this conjecture for graphs with few vertices
and we give a stronger result for traceable graphs.

Affiliated with

Also associated with

No associations

Rating

Mácajová and Škoviera Conjecture on Cubic Graphs 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 Mácajová and Škoviera Conjecture on Cubic Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mácajová and Škoviera Conjecture on Cubic Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-353747