Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph

zbMath1264.05048arXiv1103.3369MaRDI QIDQ2895393

Lily Chen, Xue Liang Li, Meng-Meng Liu

Publication date: 2 July 2012

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

zbMATH Keywords

Nordhaus-Gaddum-typerainbow vertex connection number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (10)

The rainbow vertex-index of complementary graphs ⋮ Total rainbow connection number and complementary graph ⋮ Rainbow connections of graphs: a survey ⋮ On (strong) proper vertex-connection of graphs ⋮ On rainbow total-coloring of a graph ⋮ On total rainbow \(k\)-connected graphs ⋮ Graphs with vertex rainbow connection number two ⋮ Some extremal results on the colorful monochromatic vertex-connectivity of a graph ⋮ Proper connection numbers of complementary graphs ⋮ The vertex-rainbow index of a graph

This page was built for publication: Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph