On the rainbow vertex-connection

From MaRDI portal
Publication:2860860

DOI10.7151/dmgt.1664zbMath1293.05116arXiv1012.3504OpenAlexW1993114645MaRDI QIDQ2860860

Yongtang Shi, Xue Liang Li

Publication date: 11 November 2013

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1012.3504




Related Items (28)

Hardness results for total rainbow connection of graphsThe rainbow vertex-disconnection in graphsThe rainbow vertex-index of complementary graphsTotal rainbow connection number and complementary graphUpper bounds for the total rainbow connection of graphsInjective coloring of some graph operationsProper rainbow connection number of graphsTight upper bound of the rainbow vertex-connection number for 2-connected graphsLong rainbow paths and rainbow cycles in edge colored graphs. A surveyRainbow connections of graphs: a surveyRainbow vertex-connection and forbidden subgraphsOn (strong) proper vertex-connection of graphsRainbow vertex connection of digraphsGraphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\)Rainbow vertex \(k\)-connection in graphsConflict-free vertex connection number at most 3 and size of graphsAcyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphsThe generalized 3-connectivity of star graphs and bubble-sort graphsCoupon coloring of cographsOn total rainbow \(k\)-connected graphsGeneralized rainbow connection of graphsCoupon coloring of some special graphsRainbow vertex-connection and graph productsSome results on the 3-vertex-rainbow index of a graphOn various (strong) rainbow connection numbers of graphsConflict-free vertex-connections of graphsThe vertex-rainbow index of a graphNote on the hardness of rainbow connections for planar and line graphs






This page was built for publication: On the rainbow vertex-connection