Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
type: Item
instance of: scholarly article
title: Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
zbMATH Open document ID: 1297.05084
author: Sujuan Liu
author: Xueliang Li
published in: Discrete Applied Mathematics
publication date: 2014-08-22T00:00:00Z
full work available at URL: https://arxiv.org/abs/1110.5770
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6333604
zbMATH Keywords: rainbow vertex coloring
zbMATH Keywords: rainbow vertex-connection number
zbMATH Keywords: ear decomposition
zbMATH Keywords: 2-connected graph
MaRDI profile type: Publication
OpenAlex ID: W2067304436
arXiv ID: 1110.5770
cites work: Q5422499
cites work: On rainbow connection
cites work: Rainbow connection in graphs
cites work: Further hardness results on the rainbow vertex-connection number of graphs
cites work: The complexity of determining the rainbow vertex-connection of a graph
cites work: The rainbow connection of a graph is (at most) reciprocal to its minimum degree
cites work: Rainbow connection number and connectivity
cites work: The strong rainbow vertex-connection of graphs
cites work: On the rainbow vertex-connection
cites work: Rainbow connections of graphs: a survey
cites work: Q3166468
cites work: Upper bounds for the rainbow connection numbers of line graphs
cites work: Rainbow Connection in Graphs with Minimum Degree Three
cites work: Bounds for the rainbow connection number of graphs
cites work: On minimally rainbow \(k\)-connected graphs
cites work: Rainbow connection and minimum degree
DOI: 10.1016/J.DAM.2014.04.002
description: scientific article; zbMATH DE number 6333604