Add to ORKGThe concept of monochromatic connection of graphs was introduced by Caro and Yuster in 2011. Recently, a lot of results have been published about it.In this survey, we attempt to bring together all the results that dealt with it.We begin with an introduction, and then classify the results into the following categories: monochromatic connection coloring of edge-version, monochromatic connection coloring of vertex-version, monochromatic index, monochromatic connection coloring of total-version
AbstractIf the edges of a complete graph Km, m ⩾4, are painted two colours so that monochromatic gra...
The study of proper edge-colorings of graphs has been a popular topic in graph theory since the work...
A path in an edge-colored graph $G$ is rainbow if no two edges of it arecolored the same. The graph ...
The concept of monochromatic connection of graphs was introduced by Caro and Yuster in 2011. Recentl...
AbstractAn edge-coloring of a connected graph is monochromatically-connecting if there is a monochro...
AbstractAn edge-coloring of a connected graph is monochromatically-connecting if there is a monochro...
The concept of rainbow connection was introduced by Chartrand, Johns, McKeon and Zhang in 2008. Nowa...
The concept of rainbow connection was introduced by Chartrand, Johns, McKeon and Zhang in 2008. Nowa...
Given a complete graph G, we consider two separate scenarios. First, we consider the minimum number ...
A comprehensive survey of proper connection of graphs is discussed in this book with real world appl...
Given a graph whose edges are coloured, on how many vertices can we find a monochromatic subgraph of...
For a graph G = (V, E), a vertex coloring (or, simply, a coloring) of G is a function C: V (G) → {1,...
A path in an edge-colored graph is properly colored if no two consecutive edges receive the same col...
Beginning with the origin of the four color problem in 1852, the field of graph colorings has develo...
summary:Let $G$ be a nontrivial connected graph on which is defined a coloring $c\: E(G) \rightarrow...
AbstractIf the edges of a complete graph Km, m ⩾4, are painted two colours so that monochromatic gra...
The study of proper edge-colorings of graphs has been a popular topic in graph theory since the work...
A path in an edge-colored graph $G$ is rainbow if no two edges of it arecolored the same. The graph ...
The concept of monochromatic connection of graphs was introduced by Caro and Yuster in 2011. Recentl...
AbstractAn edge-coloring of a connected graph is monochromatically-connecting if there is a monochro...
AbstractAn edge-coloring of a connected graph is monochromatically-connecting if there is a monochro...
The concept of rainbow connection was introduced by Chartrand, Johns, McKeon and Zhang in 2008. Nowa...
The concept of rainbow connection was introduced by Chartrand, Johns, McKeon and Zhang in 2008. Nowa...
Given a complete graph G, we consider two separate scenarios. First, we consider the minimum number ...
A comprehensive survey of proper connection of graphs is discussed in this book with real world appl...
Given a graph whose edges are coloured, on how many vertices can we find a monochromatic subgraph of...
For a graph G = (V, E), a vertex coloring (or, simply, a coloring) of G is a function C: V (G) → {1,...
A path in an edge-colored graph is properly colored if no two consecutive edges receive the same col...
Beginning with the origin of the four color problem in 1852, the field of graph colorings has develo...
summary:Let $G$ be a nontrivial connected graph on which is defined a coloring $c\: E(G) \rightarrow...
AbstractIf the edges of a complete graph Km, m ⩾4, are painted two colours so that monochromatic gra...
The study of proper edge-colorings of graphs has been a popular topic in graph theory since the work...
A path in an edge-colored graph $G$ is rainbow if no two edges of it arecolored the same. The graph ...