Total rainbow connection numbers of some special graphs
From MaRDI portal
Publication:2279465
DOI10.1016/j.amc.2019.05.008zbMath1428.05113OpenAlexW2947801482MaRDI QIDQ2279465
Kairui Nie, Cui Wang, Yingbin Ma, Fengxia Jin
Publication date: 12 December 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2019.05.008
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hardness results for total rainbow connection of graphs
- Rainbow connections for outerplanar graphs with diameter 2 and 3
- Total rainbow connection number and complementary graph
- Upper bounds for the total rainbow connection of graphs
- On the rainbow connectivity of graphs: complexity and FPT algorithms
- Total rainbow \(k\)-connection in graphs
- Rainbow connection of graphs with diameter 2
- Rainbow connection number and connectivity
- On rainbow total-coloring of a graph
- Total rainbow connection of digraphs
- Rainbow vertex connection of digraphs
- Rainbow connections of graphs: a survey
- On minimally rainbow \(k\)-connected graphs
- Note on the hardness of rainbow connections for planar and line graphs
- Graphs with small total rainbow connection number
- Rainbow 2-connection numbers of Cayley graphs
- Rainbow connection number and connected dominating sets
- The rainbow connectivity of a graph
- Rainbow connection in graphs
- The scattering number of thorn graphs
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- k-Degenerate Graphs
This page was built for publication: Total rainbow connection numbers of some special graphs