The strong rainbow vertex-connection of graphs
From MaRDI portal
Publication:5419848
zbMath1293.05115arXiv1201.1541MaRDI QIDQ5419848
Yaping Mao, Yongtang Shi, Xue Liang Li
Publication date: 11 June 2014
Full work available at URL: https://arxiv.org/abs/1201.1541
Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Related Items (24)
Algorithms for the rainbow vertex coloring problem on graph classes ⋮ Hardness results for total rainbow connection of graphs ⋮ The rainbow vertex-index of complementary graphs ⋮ Total rainbow connection number and complementary graph ⋮ On the complexity of rainbow coloring problems ⋮ Injective coloring of some graph operations ⋮ Proper rainbow connection number of graphs ⋮ Graphs with small total rainbow connection number ⋮ Tight upper bound of the rainbow vertex-connection number for 2-connected graphs ⋮ Rainbow connections of graphs: a survey ⋮ Total rainbow connection of digraphs ⋮ On (strong) proper vertex-connection of graphs ⋮ Rainbow vertex connection of digraphs ⋮ Further hardness results on rainbow and strong rainbow connectivity ⋮ Rainbow vertex \(k\)-connection in graphs ⋮ Conflict-free vertex connection number at most 3 and size of graphs ⋮ Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs ⋮ Graphs with vertex rainbow connection number two ⋮ Generalized rainbow connection of graphs ⋮ Complexity of rainbow vertex connectivity problems for restricted graph classes ⋮ The complexity of determining the vertex-rainbow index of graphs ⋮ On various (strong) rainbow connection numbers of graphs ⋮ Conflict-free vertex-connections of graphs ⋮ Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes
This page was built for publication: The strong rainbow vertex-connection of graphs
