Related papers: Rainbow panconnectivity in a graph collection
Rainbow connection number rc(G) of a connected graph G is the minimum number of colours needed to colour the edges of G, so that every pair of vertices is connected by at least one path in which no two edges are coloured the same. In this…
An edge-colored graph $G$, where adjacent edges may have the same color, is {\it rainbow connected} if every two vertices of $G$ are connected by a path whose edge has distinct colors. A graph $G$ is {\it $k$-rainbow connected} if one can…
A path in an edge-colored graph $G$, where adjacent edges may be colored the same, is called a rainbow path if no two edges of the path are colored the same. For a $\kappa$-connected graph $G$ and an integer $k$ with $1\leq k\leq \kappa$,…
In this note we examine the following random graph model: for an arbitrary graph $H$, with quadratic many edges, construct a graph $G$ by randomly adding $m$ edges to $H$ and randomly coloring the edges of $G$ with $r$ colors. We show that…
A vertex-colored graph $G$ is rainbow vertex-connected if any pair of distinct vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex-connection number of $G$, denoted by $rvc(G)$, is the minimum…
Let $G$ be an edge-colored graph. A rainbow (heterochromatic, or multicolored) path of $G$ is such a path in which no two edges have the same color. Let the color degree of a vertex $v$ be the number of different colors that are used on the…
A well-studied coloring problem is to assign colors to the edges of a graph $G$ so that, for every pair of vertices, all edges of at least one shortest path between them receive different colors. The minimum number of colors necessary in…
For a family of graphs $\cF$, a graph is called $\cF$-free if it does not contain any member of $\cF$ as a subgraph. Given a collection of graphs $(G_1,\ldots,G_t)$ on the same vertex set $V$ of size $n$, a rainbow graph on $V$ is obtained…
In a graph $G$ with a given edge colouring, a rainbow path is a path all of whose edges have distinct colours. The minimum number of colours required to colour the edges of $G$ so that every pair of vertices is joined by at least one…
An edge-cut $R$ of an edge-colored connected graph is called a rainbow-cut if no two edges in the edge-cut are colored the same. An edge-colored graph is rainbow disconnected if for any two distinct vertices $u$ and $v$ of the graph, there…
Let $G$ be an edge-colored graph with $n$ vertices. A subgraph $H$ of $G$ is called a rainbow subgraph of $G$ if the colors of each pair of the edges in $E(H)$ are distinct. We define the minimum color degree of $G$ to be the smallest…
A total-colored graph is a graph $G$ such that both all edges and all vertices of $G$ are colored. A path in a total-colored graph $G$ is a total rainbow path if its edges and internal vertices have distinct colors. A total-colored graph…
Let $G$ be a nontrivial edge-colored connected graph. An edge-cut $R$ of $G$ is called a rainbow cut if no two edges of it are colored the same. An edge-colored graph $G$ is rainbow disconnected if for every two vertices $u$ and $v$, there…
Let $G$ be an edge-colored graph. We use $e(G)$ and $c(G)$ to denote the number of edges of $G$ and the number of colors appearing on $E(G)$, respectively. For a vertex $v\in V(G)$, the \emph{color neighborhood} of $v$ is defined as the set…
An edge-coloured path is \emph{rainbow} if its edges have distinct colours. An edge-coloured connected graph is said to be \emph{rainbow connected} if any two vertices are connected by a rainbow path, and \emph{strongly rainbow connected}…
An edge-coloured path is \emph{rainbow} if all the edges have distinct colours. For a connected graph $G$, the \emph{rainbow connection number} $rc(G)$ is the minimum number of colours in an edge-colouring of $G$ such that, any two vertices…
The oriented diameter of a bridgeless graph $G$ is $\min\{diam(H)\ | H\ is\ an orientation\ of\ G\}$. A path in an edge-colored graph $G$, where adjacent edges may have the same color, is called rainbow if no two edges of the path are…
A path in an edge-colored graph is called {\em rainbow} if no two edges of it are colored the same. For an $\ell$-connected graph $G$ and an integer $k$ with $1\leq k\leq \ell$, the {\em rainbow $k$-connection number} $rc_k(G)$ of $G$ is…
A path in an edge-colored graph is called a monochromatic path if all edges of the path have a same color. We call $k$ paths $P_1,\cdots,P_k$ rainbow monochromatic paths if every $P_i$ is monochromatic and for any two $i\neq j$, $P_i$ and…
Let $G$ be a nontrivial connected graph with an edge-coloring $c: E(G)\rightarrow \{1,2,...,q\},$ $q \in \mathbb{N}$, where adjacent edges may be colored the same. A tree $T$ in $G$ is a $rainbow tree$ if no two edges of $T$ receive the…