The hitting time of rainbow connection number two

zbMath1266.05034arXiv1209.2981MaRDI QIDQ1953346

Annika Heckel, Oliver Riordan

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

random graphrainbow connection numberrandom graph process

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (7)

Colorful Hamilton Cycles in Random Graphs ⋮ Rainbow connections for outerplanar graphs with diameter 2 and 3 ⋮ Rainbow Connection of Random Regular Graphs ⋮ Elegantly Colored Paths and Cycles in Edge Colored Random Graphs ⋮ The threshold for the full perfect matching color profile in a random coloring of random graphs ⋮ On the threshold for rainbow connection number \(r\) in random graphs ⋮ Pattern Colored Hamilton Cycles in Random Graphs

This page was built for publication: The hitting time of rainbow connection number two