On total rainbow \(k\)-connected graphs
type: Item
instance of: scholarly article
title: On total rainbow \(k\)-connected graphs
zbMATH Open document ID: 1426.05050
author: Xianqiang Yang
published in: Applied Mathematics and Computation
publication date: 2019-04-29T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 7048785
zbMATH Keywords: total rainbow coloring
zbMATH Keywords: total rainbow connection number
zbMATH Keywords: minimally total rainbow \(k\)-connected graph
MaRDI profile type: MaRDI publication profile
full work available at URL: j.amc.2017.05.020
OpenAlex ID: W2616177764
cites work: The minimum size of \(k\)-rainbow connected graphs of given order
cites work: Q5422499
cites work: On rainbow connection
cites work: Hardness and algorithms for rainbow connection
cites work: Rainbow connection in graphs
cites work: The rainbow connectivity of a graph
cites work: Nordhaus-Gaddum-type bounds for the rainbow vertex-connection number of a graph
cites work: On forbidden subgraphs and rainbow connection in graphs with minimum degree 2
cites work: Note on the hardness of rainbow connections for planar and line graphs
cites work: The rainbow connection of a graph is (at most) reciprocal to its minimum degree
cites work: Total rainbow connection of digraphs
cites work: Note on minimally \(d\)-rainbow connected graphs
cites work: Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs
cites work: On the rainbow vertex-connection
cites work: Rainbow connections of graphs: a survey
cites work: Rainbow connection numbers of complementary graphs
cites work: The rainbow $k$-connectivity of two classes of graphs
cites work: Upper bounds for the rainbow connection numbers of line graphs
cites work: On the strong rainbow connection of a graph
cites work: Total rainbow \(k\)-connection in graphs
cites work: On minimally rainbow \(k\)-connected graphs
cites work: On rainbow total-coloring of a graph
cites work: Rainbow Connection Numbers for Undirected Double-Loop Networks
cites work: Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number
cites work: On the rainbow connectivity of graphs: complexity and FPT algorithms
DOI: 10.1016/J.AMC.2017.05.020
Recommended article: Total rainbow \(k\)-connection in graphs
Recommended article: The rainbow $k$-connectivity of two classes of graphs
Recommended article: Q4636190
Recommended article: On minimally rainbow \(k\)-connected graphs
Recommended article: Total rainbow connection numbers of some special graphs
Recommended article: Q5206405
Recommended article: On various (strong) rainbow connection numbers of graphs
Recommended article: Rainbow vertex \(k\)-connection in graphs
Recommended article: Q5500302
Recommended article: Total $k$-Rainbow domination numbers in graphs
description: scientific article; zbMATH DE number 7048785