Decomposing various graphs into short even-length cycles

Details Decomposing various graphs into short even-length cycles Decomposing various graphs into short even-length cycles

2012-04-16

arxiv.org/abs/1204.3368v1

Mathematics

Combinatorics

30 pages, no figures

Scientific paper

We prove that a complete bipartite graph can be decomposed into cycles of arbitrary specified lengths provided that the obvious necessary conditions are satisfied, the length of each cycle is at most the size of the smallest part, and the longest cycle is at most three times as long as the second longest. We then use this result to obtain results on incomplete even cycle systems with a hole and on decompositions of complete multipartite graphs into cycles of uniform even length.

Affiliated with

Also associated with

No associations

Rating

Decomposing various graphs into short even-length cycles 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 Decomposing various graphs into short even-length cycles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decomposing various graphs into short even-length cycles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-5941