Rainbow connection number and connected dominating sets
type: Item
instance of: scholarly article
title: Rainbow connection number and connected dominating sets
zbMATH Open document ID: 1248.05098
author: L. Sunil Chandran
author: Anita Das
author: Deepak Rajendraprasad
author: Nithin M. Varma
published in: Journal of Graph Theory
publication date: 2012-09-12T00:00:00Z
full work available at URL: https://arxiv.org/abs/1010.2296
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6081440
zbMATH Keywords: rainbow connectivity
zbMATH Keywords: rainbow coloring
zbMATH Keywords: connected dominating set
zbMATH Keywords: connected two-step dominating set
zbMATH Keywords: radius
zbMATH Keywords: minimum degree
MaRDI profile type: Publication
OpenAlex ID: W1535932596
arXiv ID: 1010.2296
cites work: On rainbow connection
cites work: Hardness and Algorithms for Rainbow Connectivity
cites work: Rainbow connection in graphs
cites work: Q3525736
cites work: Asteroidal Triple-Free Graphs
cites work: The rainbow connection of a graph is (at most) reciprocal to its minimum degree
cites work: The Complexity of the Partial Order Dimension Problem
DOI: 10.1002/JGT.20643
description: scientific article; zbMATH DE number 6081440