Total rainbow \(k\)-connection in graphs
From MaRDI portal
Publication:400527
DOI10.1016/j.dam.2014.04.012zbMath1298.05127OpenAlexW1984354963MaRDI QIDQ400527
Ângela Mestre, Teresa Sousa, Henry Liu
Publication date: 22 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.04.012
Related Items (23)
Hardness results for total rainbow connection of graphs ⋮ Some results on the total proper \(k\)-connection number ⋮ Total monochromatic connection of graphs ⋮ Some results on the 3-total-rainbow index ⋮ Total rainbow connection number and complementary graph ⋮ Upper bounds for the total rainbow connection of graphs ⋮ Note on vertex and total proper connection numbers ⋮ Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number ⋮ Rainbow vertex-connection number on a small-world Farey graph ⋮ Graphs with small total rainbow connection number ⋮ Total rainbow connection of digraphs ⋮ Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\) ⋮ Hardness result for the total rainbow \(k\)-connection of graphs ⋮ Rainbow connection numbers of Cayley digraphs on abelian groups ⋮ On total rainbow \(k\)-connected graphs ⋮ Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs ⋮ Rainbow connections in digraphs ⋮ On the total proper connection of graphs ⋮ Some results on the 3-vertex-rainbow index of a graph ⋮ On various (strong) rainbow connection numbers of graphs ⋮ Total rainbow connection numbers of some special graphs ⋮ (Strong) total proper connection of some digraphs ⋮ Erdős-Gallai-type results for total monochromatic connection of graphs
Cites Work
- Rainbow paths
- Rainbow connections of graphs: a survey
- Rainbow vertex \(k\)-connection in graphs
- Note on the Rainbow $k$-Connectivity of Regular Complete Bipartite Graphs
- 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
- Unnamed Item
- Unnamed Item
This page was built for publication: Total rainbow \(k\)-connection in graphs