Rainbow connection of sparse random graphs

zbMath1266.05030MaRDI QIDQ1953307

Charalampos E. Tsourakakis, Alan M. Frieze

Publication date: 7 June 2013

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

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i4p5

zbMATH Keywords

random graphsrainbow connection

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Density (toughness, etc.) (05C42)

Related Items (8)

Colorful Hamilton Cycles in Random Graphs ⋮ The rainbow connection number of the power graph of a finite group ⋮ Elegantly Colored Paths and Cycles in Edge Colored Random Graphs ⋮ Rainbow connectivity and rainbow index of inhomogeneous random graphs ⋮ Conflict-free connection number of random graphs ⋮ Proper connection number of random graphs ⋮ Concentration of rainbow \(k\)-connectivity of a multiplex random graph ⋮ On the threshold for rainbow connection number \(r\) in random graphs

This page was built for publication: Rainbow connection of sparse random graphs