Title of article
Size of monochromatic components in local edge colorings
Author/Authors
Andr?s Gy?rf?s، نويسنده , , G?bor N. S?rk?zy، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
3
From page
2620
To page
2622
Abstract
An edge coloring of a graph is a local r coloring if the edges incident to any vertex are colored with at most r distinct colors. We determine the size of the largest monochromatic component that must occur in any local r coloring of a complete graph or a complete bipartite graph.
Keywords
Local colorings , Connected components
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
947356
Link To Document