Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
type: Item
instance of: scholarly article
title: Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
zbMATH Open document ID: 1272.05044
author: Lily Chen
author: Xueliang Li
author: Huishu Lian
published in: Graphs and Combinatorics
publication date: 2013-09-26T00:00:00Z
full work available at URL: https://arxiv.org/abs/1012.2641
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6211664
zbMATH Keywords: edge-colored graph
zbMATH Keywords: rainbow connection number
zbMATH Keywords: Nordhaus-Gaddum-type
MaRDI profile type: Publication
OpenAlex ID: W2000391936
arXiv ID: 1012.2641
cites work: Q5422499
cites work: Rainbow connection number and connected dominating sets
cites work: Rainbow connection in graphs
cites work: Nordhaus-Gaddum inequalities for domination in graphs
cites work: The Diameter of a Graph and its Complement
cites work: Rainbow connections of graphs: a survey
cites work: On Complementary Graphs
cites work: Q3377651
DOI: 10.1007/S00373-012-1183-X
description: scientific article