The minimum size of k-rainbow connected graphs of given order

DOI10.1016/J.DISC.2012.07.023zbMATH Open1277.05056OpenAlexW1967982435MaRDI QIDQ383755FDOQ383755

Authors: 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

Recommendations

• A note on the minimum size of \(k\)-rainbow-connected graphs
• Smallest \(k\)-rainbow connected graphs for large \(k\)
• On minimally rainbow \(k\)-connected graphs
• The minimum size of graphs with given rainbow index
• The size of graphs with restricted rainbow 2-connection number

zbMATH Keywords

\(k\)-rainbow connection

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On minimally rainbow \(k\)-connected graphs

Cited In (9)

• A note on the minimum size of \(k\)-rainbow-connected graphs
• The minimum size of graphs with given rainbow index
• Note on minimally \(d\)-rainbow connected graphs
• Rainbow connection number and graph operations
• More on the minimum size of graphs with given rainbow index
• On minimally rainbow \(k\)-connected graphs
• Smallest \(k\)-rainbow connected graphs for large \(k\)
• The vertex-rainbow connection number of some graph operations
• On total rainbow \(k\)-connected graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383755)