On the perfect matching index of bridgeless cubic graphs

Details On the perfect matching index of bridgeless cubic graphs On the perfect matching index of bridgeless cubic graphs

2009-04-08

arxiv.org/abs/0904.1296v1

Computer Science

Discrete Mathematics

Scientific paper

If $G$ is a bridgeless cubic graph, Fulkerson conjectured that we can find 6 perfect matchings $M_1,...,M_6$ of $G$ with the property that every edge of $G$ is contained in exactly two of them and Berge conjectured that its edge set can be covered by 5 perfect matchings. We define $\tau(G)$ as the least number of perfect matchings allowing to cover the edge set of a bridgeless cubic graph and we study this parameter. The set of graphs with perfect matching index 4 seems interesting and we give some informations on this class.

Affiliated with

Also associated with

No associations

Rating

On the perfect matching index of bridgeless 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 On the perfect matching index of bridgeless cubic graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the perfect matching index of bridgeless cubic graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-214355