Total rainbow connection number and complementary graph
type: Item
instance of: scholarly article
title: Total rainbow connection number and complementary graph
zbMATH Open document ID: 1344.05064
author: Yingbin Ma
published in: Results in Mathematics
publication date: 2016-09-08T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6625530
zbMATH Keywords: vertex-coloring
zbMATH Keywords: vertex rainbow path
zbMATH Keywords: rainbow vertex connected
zbMATH Keywords: total-coloring
zbMATH Keywords: total rainbow path
zbMATH Keywords: total rainbow connected
zbMATH Keywords: complementary graph
zbMATH Keywords: triangle-free
zbMATH Keywords: Nordhaus-Gaddum-type
MaRDI profile type: Publication
full work available at URL: s00025-015-0469-8
OpenAlex ID: W1156767371
cites work: A survey of Nordhaus-Gaddum type relations
cites work: Q5422499
cites work: Rainbow connection in graphs
cites work: Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
cites work: Nordhaus-Gaddum-type bounds for the rainbow vertex-connection number of a graph
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: The strong rainbow vertex-connection of graphs
cites work: On the rainbow vertex-connection
cites work: Rainbow connections of graphs: a survey
cites work: Total rainbow \(k\)-connection in graphs
cites work: Graphs with vertex rainbow connection number two
cites work: On Complementary Graphs
cites work: Rainbow connection numbers of complementary graphs
cites work: On the rainbow connectivity of graphs: complexity and FPT algorithms
DOI: 10.1007/S00025-015-0469-8
description: scientific article; zbMATH DE number 6625530