AbstractIf the edges of a graph G are colored using k colors, we consider the color distribution for this coloring a=(a1,a2,…,ak), in which ai denotes the number of edges of color i for i=1,2,…,k. We find inequalities and majorization conditions on color distributions of the complete bipartite graph Kn,n which guarantee the existence of multicolored subgraphs: in particular, multicolored forests and trees. We end with a conjecture on partitions of Kn,n into multicolored trees
We show that any complete k-partite graph G on n vertices, with k >= 3, whose edges are two-coloured...
© 2018 Wiley Periodicals, Inc. We show that any complete k-partite graph G on n vertices, with k≥3, ...
AbstractIf each edge of complete graph Kn is colored with one of k colors then it contains a triangl...
AbstractIf the edges of a graph G are colored using k colors, we consider the color distribution for...
AbstractWe prove the existence of two edge-disjoint multicolored spanning trees in any edge-coloring...
AbstractLet G=(V,E) be an edge-colored graph. A subgraph H is said to be monochromatic if all the ed...
AbstractIn a previous paper we investigated the problem of counting the number of multicolored spann...
The tree partition number of an r-edge-colored graph G, denoted by tr(G), is the minimum number k su...
AbstractIn a previous paper we investigated the problem of counting the number of multicolored spann...
Can a complete graph on an even number n (>4) of vertices be properly edge-colored with n-1 colors i...
Can a complete graph on an even number n (>4) of vertices be properly edge-colored with n-1 c...
Given a graph whose edges are coloured, on how many vertices can we find a monochromatic subgraph of...
AbstractLet G=(V,E) be an edge-colored graph. A subgraph H is said to be monochromatic if all the ed...
AbstractIn this paper we consider colorings of the edges of the complete graph Km with n colors such...
We show that any complete k-partite graph G on n vertices, with k >= 3, whose edges are two-coloured...
We show that any complete k-partite graph G on n vertices, with k >= 3, whose edges are two-coloured...
© 2018 Wiley Periodicals, Inc. We show that any complete k-partite graph G on n vertices, with k≥3, ...
AbstractIf each edge of complete graph Kn is colored with one of k colors then it contains a triangl...
AbstractIf the edges of a graph G are colored using k colors, we consider the color distribution for...
AbstractWe prove the existence of two edge-disjoint multicolored spanning trees in any edge-coloring...
AbstractLet G=(V,E) be an edge-colored graph. A subgraph H is said to be monochromatic if all the ed...
AbstractIn a previous paper we investigated the problem of counting the number of multicolored spann...
The tree partition number of an r-edge-colored graph G, denoted by tr(G), is the minimum number k su...
AbstractIn a previous paper we investigated the problem of counting the number of multicolored spann...
Can a complete graph on an even number n (>4) of vertices be properly edge-colored with n-1 colors i...
Can a complete graph on an even number n (>4) of vertices be properly edge-colored with n-1 c...
Given a graph whose edges are coloured, on how many vertices can we find a monochromatic subgraph of...
AbstractLet G=(V,E) be an edge-colored graph. A subgraph H is said to be monochromatic if all the ed...
AbstractIn this paper we consider colorings of the edges of the complete graph Km with n colors such...
We show that any complete k-partite graph G on n vertices, with k >= 3, whose edges are two-coloured...
We show that any complete k-partite graph G on n vertices, with k >= 3, whose edges are two-coloured...
© 2018 Wiley Periodicals, Inc. We show that any complete k-partite graph G on n vertices, with k≥3, ...
AbstractIf each edge of complete graph Kn is colored with one of k colors then it contains a triangl...
DOI
Add to ORKG