Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Vertex rainbow colorings of graphs

Futaba Fujie-OkamotoKyle KolasinskiJianwei LinPing Zhang — 2012

Discussiones Mathematicae Graph Theory

In a properly vertex-colored graph G, a path P is a rainbow path if no two vertices of P have the same color, except possibly the two end-vertices of P. If every two vertices of G are connected by a rainbow path, then G is vertex rainbow-connected. A proper vertex coloring of a connected graph G that results in a vertex rainbow-connected graph is a vertex rainbow coloring of G. The minimum number of colors needed in a vertex rainbow coloring of G is the vertex rainbow connection number vrc(G) of...

Page 1

Download Results (CSV)