AbstractAn edge-coloring of a connected graph is monochromatically-connecting if there is a monochromatic path joining any two vertices. How “colorful” can a monochromatically-connecting coloring be? Let mc(G) denote the maximum number of colors used in a monochromatically-connecting coloring of a graph G. We prove some nontrivial upper and lower bounds for mc(G) and relate it to other graph parameters such as the chromatic number, the connectivity, the maximum degree, and the diameter
Given an $r$-edge-coloring of the complete graph $K_n$, what is the largest number of edges in a mon...
An edge-coloured graph G is rainbow-connected if any two vertices are connected by a path whose edge...
International audienceA graph G has maximal local edge-connectivity k if the maximum number of edge-...
AbstractAn edge-coloring of a connected graph is monochromatically-connecting if there is a monochro...
We say an edge-colored graph is properly connected if, between every pair of vertices, there exists ...
We say an edge-colored graph is properly connected if, between every pair of vertices, there exists ...
We say an edge-colored graph is properly connected if, between every pair of vertices, there exists ...
The concept of monochromatic connection of graphs was introduced by Caro and Yuster in 2011. Recentl...
For every n∈N and k≥2, Gyárfás showed that every k-edge-colouring of the com...
The concept of monochromatic connection of graphs was introduced by Caro and Yuster in 2011. Recentl...
Given a graph whose edges are coloured, on how many vertices can we find a monochromatic subgraph of...
An edge-coloured graph G is rainbow-connected if any two vertices are connected by a path whose edge...
An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edge...
A path in an edge-colored graph is properly colored if no two consecutive edges receive the same col...
For an edge-colored graph, its minimum color degree is defined as the minimum number of colors appea...
Given an $r$-edge-coloring of the complete graph $K_n$, what is the largest number of edges in a mon...
An edge-coloured graph G is rainbow-connected if any two vertices are connected by a path whose edge...
International audienceA graph G has maximal local edge-connectivity k if the maximum number of edge-...
AbstractAn edge-coloring of a connected graph is monochromatically-connecting if there is a monochro...
We say an edge-colored graph is properly connected if, between every pair of vertices, there exists ...
We say an edge-colored graph is properly connected if, between every pair of vertices, there exists ...
We say an edge-colored graph is properly connected if, between every pair of vertices, there exists ...
The concept of monochromatic connection of graphs was introduced by Caro and Yuster in 2011. Recentl...
For every n∈N and k≥2, Gyárfás showed that every k-edge-colouring of the com...
The concept of monochromatic connection of graphs was introduced by Caro and Yuster in 2011. Recentl...
Given a graph whose edges are coloured, on how many vertices can we find a monochromatic subgraph of...
An edge-coloured graph G is rainbow-connected if any two vertices are connected by a path whose edge...
An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edge...
A path in an edge-colored graph is properly colored if no two consecutive edges receive the same col...
For an edge-colored graph, its minimum color degree is defined as the minimum number of colors appea...
Given an $r$-edge-coloring of the complete graph $K_n$, what is the largest number of edges in a mon...
An edge-coloured graph G is rainbow-connected if any two vertices are connected by a path whose edge...
International audienceA graph G has maximal local edge-connectivity k if the maximum number of edge-...
DOI
Add to ORKG