On various (strong) rainbow connection numbers of graphs
From MaRDI portal
Publication:5374232
zbMath1383.05177arXiv1601.01063MaRDI QIDQ5374232
No author found.
Publication date: 10 April 2018
Full work available at URL: https://arxiv.org/abs/1601.01063
Cites Work
- Unnamed Item
- Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs
- Total rainbow connection number and complementary graph
- Upper bounds for the total rainbow connection of graphs
- Further hardness results on the rainbow vertex-connection number of graphs
- Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
- Total rainbow \(k\)-connection in graphs
- Rainbow connection in oriented graphs
- On rainbow total-coloring of a graph
- Rainbow connection in some digraphs
- Rainbow connectivity of cacti and of some infinite digraphs
- The complexity of determining the rainbow vertex-connection of a graph
- On rainbow connection
- Total rainbow connection of digraphs
- Rainbow vertex connection of digraphs
- On total rainbow \(k\)-connected graphs
- Rainbow connections of graphs: a survey
- Note on the hardness of rainbow connections for planar and line graphs
- On the strong rainbow connection of a graph
- The (strong) rainbow connection numbers of Cayley graphs on abelian groups
- Rainbow vertex \(k\)-connection in graphs
- On the rainbow vertex-connection
- Rainbow connection in graphs
- A solution to a conjecture on the rainbow connection number
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- Note on rainbow connection in oriented graphs with diameter 2
- Hardness and Algorithms for Rainbow Connectivity
- The strong rainbow vertex-connection of graphs
