On disjoint matchings in cubic graphs: maximum 2- and 3-edge-colorable subgraphs

Details On disjoint matchings in cubic graphs: maximum 2- and 3-edge-colorable subgraphs On disjoint matchings in cubic graphs: maximum 2- and 3-edge-colorable subgraphs

2009-09-15

arxiv.org/abs/0909.2767v2

Computer Science

Discrete Mathematics

31 pages, 14 figures, majorly revised, new result is added

Scientific paper

We show that any $2-$factor of a cubic graph can be extended to a maximum $3-$edge-colorable subgraph. We also show that the sum of sizes of maximum $2-$ and $3-$edge-colorable subgraphs of a cubic graph is at least twice of its number of vertices. Finally, for a cubic graph $G$, consider the pairs of edge-disjoint matchings whose union consists of as many edges as possible. Let $H$ be the largest matching among such pairs. Let $M$ be a maximum matching of $G$. We show that 9/8 is a tight upper bound for $|M|/|H|$.

Affiliated with

Also associated with

No associations

Rating

On disjoint matchings in cubic graphs: maximum 2- and 3-edge-colorable subgraphs 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 disjoint matchings in cubic graphs: maximum 2- and 3-edge-colorable subgraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On disjoint matchings in cubic graphs: maximum 2- and 3-edge-colorable subgraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-555841