Smallest k-rainbow connected graphs for large k

zbMATH Open1278.05094MaRDI QIDQ2869375FDOQ2869375

Authors: Jens-P. Bode, Heiko Harborth 

Publication date: 3 January 2014

Published in: Congressus Numerantium (Search for Journal in Brave)

Recommendations

• The minimum size of \(k\)-rainbow connected graphs of given order
• On minimally rainbow \(k\)-connected graphs
• A note on the minimum size of \(k\)-rainbow-connected graphs
• The minimum size of graphs with given rainbow index
• Rainbow connection in sparse graphs

Mathematics Subject Classification ID

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

Cited In (7)

• 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
• A note on \(k\)-rainbow connection in trees
• On minimally rainbow \(k\)-connected graphs
• The minimum size of \(k\)-rainbow connected graphs of given order
• On \(k\)-rainbow connection in graphs

This page was built for publication: Smallest \(k\)-rainbow connected graphs for large \(k\)

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