Mathematics – Combinatorics
Scientific paper
2010-08-25
Mathematics
Combinatorics
Scientific paper
In this paper, we generalize the notions of perfect matchings, perfect 2-matchings to perfect k-matchings and give a necessary and sufficient condition for existence of perfect k-matchings. For bipartite graphs, we show that this k-matching problem is equivalent to that matching question. Moreover, for regular graphs, we provide a sufficient condition of perfect k-matching in terms of edge connectivity.
No associations
LandOfFree
On perfect k-matchings 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 perfect k-matchings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On perfect k-matchings will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-525272