Name
Abstract | ||
|---|---|---|
An edge-coloured path is rainbow if its edges have distinct colours. For a connected graph G, the rainbow connection number (resp. strong rainbow connection number) of G is the minimum number of colours required to colour the edges of G so that any two vertices of G are connected by a rainbow path (resp. rainbow geodesic). These two graph parameters were introduced by Chartrand, Johns, McKeon, and Zhang in 2008. Krivelevich and Yuster generalised this concept to the vertex-coloured setting. Similarly, Liu, Mestre, and Sousa introduced the version which involves total-colourings. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.dam.2017.10.016 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Total rainbow connection,Digraph,Tournament,Cactus digraph,Biorientation | Graph,Discrete mathematics,Combinatorics,Tournament,Two-graph,Vertex (geometry),Connectivity,Rainbow,Mathematics,Digraph,Geodesic | Journal |
Volume | Issue | ISSN |
236 | C | 0166-218X |
Citations | PageRank | References |
3 | 0.44 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hui Lei | 1 | 25 | 5.89 |
| Henry Liu | 2 | 16 | 5.35 |
| Colton Magnant | 3 | 113 | 29.08 |
| Yongtang Shi | 4 | 511 | 55.83 |