[HTML][HTML] Size of monochromatic components in local edge colorings
A Gyárfás, GN Sárközy - Discrete mathematics, 2008 - Elsevier
Discrete mathematics, 2008•Elsevier
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.
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.
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.
Elsevier
Showing the best result for this search. See all results