On path factors of (3,4)-biregular bigraphs

Details On path factors of (3,4)-biregular bigraphs On path factors of (3,4)-biregular bigraphs

2007-06-12

arxiv.org/abs/0706.1740v1

Mathematics

Combinatorics

7 pages

Scientific paper

A (3,4)-biregular bigraph G is a bipartite graph where all vertices in one part have degree 3 and all vertices in the other part have degree 4. A path factor of G is a spanning subgraph whose components are nontrivial paths. We prove that a simple (3,4)-biregular bigraph always has a path factor such that the endpoints of each path have degree three. Moreover we suggest a polynomial algorithm for the construction of such a path factor.

Affiliated with

Also associated with

No associations

Rating

On path factors of (3,4)-biregular bigraphs 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 path factors of (3,4)-biregular bigraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On path factors of (3,4)-biregular bigraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-359925