Name
Abstract | ||
|---|---|---|
AbstractAn edge coloring of a graph is said to be an r-local coloring if the edges incident to any vertex are colored with at most r colors. Generalizing a result of Bessy and Thomassé, we prove that the vertex set of any 2-locally colored complete graph may be partitioned into two disjoint monochromatic cycles of different colors. Moreover, for any natural number r, we show that the vertex set of any r-locally colored complete graph may be partitioned into Or2logr disjoint monochromatic cycles. This generalizes a result of Erdï s, Gyárfás, and Pyber. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1002/jgt.21867 | Periodicals |
Field | DocType | Volume |
Topology,Edge coloring,Complete coloring,Discrete mathematics,Combinatorics,Circulant graph,Fractional coloring,Graph factorization,Vertex (graph theory),Neighbourhood (graph theory),Cycle graph,Mathematics | Journal | 81 |
Issue | ISSN | Citations |
2 | 0364-9024 | 3 |
PageRank | References | Authors |
0.43 | 11 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Conlon | 1 | 26 | 3.01 |
| maya stein | 2 | 81 | 15.65 |