The minimum size of \(k\)-rainbow connected graphs of given order

DOI10.1016/j.disc.2012.07.023zbMath1277.05056OpenAlexW1967982435MaRDI QIDQ383755

Jens-P. Bode, Heiko Harborth

Publication date: 6 December 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.07.023

zbMATH Keywords

\(k\)-rainbow connection

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (5)

Rainbow connection number and graph operations ⋮ A note on the minimum size of \(k\)-rainbow-connected graphs ⋮ The vertex-rainbow connection number of some graph operations ⋮ On total rainbow \(k\)-connected graphs ⋮ Note on minimally \(d\)-rainbow connected graphs

Cites Work

• Unnamed Item
• On minimally rainbow \(k\)-connected graphs

This page was built for publication: The minimum size of \(k\)-rainbow connected graphs of given order