Some extremal results on the colorful monochromatic vertex-connectivity of a graph

Qingqiong Cai, Xueliang Li, Di Wu

A path in a vertex-colored graph is called a \emph{vertex-monochromatic path} if its internal vertices have the same color. A vertex-coloring of a graph is a \emph{monochromatic ve…