Name
Abstract | ||
|---|---|---|
Let G be a graph of order n with an edge coloring c , and let ¿ c ( G ) denote the minimum color degree of G , i.e., the largest integer such that each vertex of G is incident with at least ¿ c ( G ) edges having pairwise distinct colors. A subgraph F ¿ G is rainbow if all edges of F have pairwise distinct colors. In this paper, we prove that (i) if G is triangle-free and ¿ c ( G ) n 3 + 1 , then G contains a rainbow C 4 , and (ii) if ¿ c ( G ) n 2 + 2 , then G contains a rainbow cycle of length at least 4. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.disc.2015.12.003 | Discrete Mathematics |
Keywords | DocType | Volume |
edge coloring | Journal | 339 |
Issue | ISSN | Citations |
4 | 0012-365X | 2 |
PageRank | References | Authors |
0.42 | 4 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roman Cada | 1 | 40 | 8.35 |
| Atsushi Kaneko | 2 | 169 | 24.21 |
| Zdenek Ryjácek | 3 | 106 | 15.46 |
| Kiyoshi Yoshimoto | 4 | 133 | 22.65 |
| ČadaRoman | 5 | 2 | 0.42 |
| RyjáčekZdenĕk | 6 | 2 | 0.42 |