Abstract

Let Kn,m be an edge-colored complete bipartite graph with 1≤n≤m and Δmon(Kn,m) be the number of the leaves of a maximum monochromatic star in Kn,m. In this paper, we show that if Δmon(Kn,m)≤n−2k+1, then Kn,m has k disjoint properly colored cycles.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call