On total rainbow \(k\)-connected graphs

DOI10.1016/J.AMC.2017.05.020zbMath1426.05050OpenAlexW2616177764MaRDI QIDQ1739988

Xianqiang Yang

Publication date: 29 April 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2017.05.020

zbMATH Keywords

minimally total rainbow \(k\)-connected graphtotal rainbow coloringtotal rainbow connection number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (4)

Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number ⋮ Spectrum graph coloring and applications to Wi-Fi channel assignment ⋮ On various (strong) rainbow connection numbers of graphs ⋮ Note on the vertex-rainbow index of a graph

Cites Work

• Unnamed Item
• Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs
• On the rainbow connectivity of graphs: complexity and FPT algorithms
• The minimum size of \(k\)-rainbow connected graphs of given order
• Total rainbow \(k\)-connection in graphs
• On forbidden subgraphs and rainbow connection in graphs with minimum degree 2
• Hardness and algorithms for rainbow connection
• On rainbow total-coloring of a graph
• Note on minimally \(d\)-rainbow connected graphs
• On rainbow connection
• Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number
• Total rainbow connection of digraphs
• Upper bounds for the rainbow connection numbers of line graphs
• Rainbow connections of graphs: a survey
• On minimally rainbow \(k\)-connected graphs
• Note on the hardness of rainbow connections for planar and line graphs
• On the strong rainbow connection of a graph
• On the rainbow vertex-connection
• Rainbow connection numbers of complementary graphs
• Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph
• Rainbow Connection Numbers for Undirected Double-Loop Networks
• The rainbow connectivity of a graph
• The rainbow $k$-connectivity of two classes of graphs
• Rainbow connection in graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree

This page was built for publication: On total rainbow \(k\)-connected graphs