Name
Abstract | ||
|---|---|---|
Let G be a d-regular properly edge-colored graph such that the edges with the same color induce a 1-factor of G. A rainbow matching of G is a matching in which no two edges have the same color. We show that if the order n of G is at least 3.79d, then G has a rainbow matching of size d. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1142/S1793830913500286 | DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS |
Keywords | Field | DocType |
Rainbow matchings, properly colored graphs, 1-factor | Discrete mathematics,Graph,Combinatorics,Rainbow,Mathematics | Journal |
Volume | Issue | ISSN |
5 | 4 | 1793-8309 |
Citations | PageRank | References |
1 | 0.36 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guanghui Wang | 1 | 199 | 23.23 |
| Bingqiang Liu | 2 | 43 | 4.88 |
| Guizhen Liu | 3 | 175 | 27.36 |