We show that for any 2-local colouring of the edges of the balanced complete bipartite graph, its vertices can be covered with at most 3 disjoint monochromatic ...

Jan 22, 2015 · And, we can cover almost all vertices of any complete or balanced complete bipartite r-locally coloured graph with O(r^2) disjoint monochromatic ...

We show that for any 2-local colouring of the edges of a complete bipartite graph, its vertices can be covered with at most 3 disjoint monochromatic paths.

Sep 9, 2016 · Abstract. We show that for any 2-local colouring of the edges of the balanced complete bipartite graph Kn,n, its vertices can be covered ...

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 show that for any 2-local colouring of the edges of the balanced complete bipartite graph Kn,n, its vertices can be covered with at most 3 disjoint ...

We show that for any $2$-local colouring of the edges of a complete bipartite graph, its vertices can be covered with at most $3$ disjoint monochromatic ...

We show that any complete ‐partite graph on vertices, with , whose edges are two‐coloured, can be covered with two vertex‐disjoint monochromatic paths of ...

TL;DR: In this paper, it was shown that for any 2-local colouring of the edges of a complete bipartite graph, its vertices can be covered with at most 3 ...

Richard Lang , Maya Stein : Local colourings and monochromatic partitions in complete bipartite graphs. Electron. Notes Discret. Math. 49: 757-763 (2015).