On the strong rainbow connection of a graph

zbMath1268.05079arXiv1010.6139MaRDI QIDQ2376940

Yuefang Sun, Xue Liang Li

Publication date: 26 June 2013

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.6139

zbMATH Keywords

edge-colored graphrainbow pathstrong rainbow connection numberedge-disjoint trianglerainbow geodesic

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Connectivity (05C40)

Related Items (9)

Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number ⋮ Unnamed Item ⋮ Proper connection number of graph products ⋮ On rainbow total-coloring of a graph ⋮ On total rainbow \(k\)-connected graphs ⋮ Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks ⋮ On various (strong) rainbow connection numbers of graphs ⋮ Rainbow \(C_4\)'s and directed \(C_4\)'s: the bipartite case study ⋮ The \((k,\ell)\)-rainbow index of random graphs

This page was built for publication: On the strong rainbow connection of a graph