Rainbow connection in sparse graphs

DOI10.7151/DMGT.1640MaRDI QIDQ2866459zbMATH OpenOpenAlexFDO

Authors Arnfried Kemnitz, Jakub Przybyło, Mariusz Woźniak, Ingo Schiermeyer

Publication date 13 December 2013

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.7151/dmgt.1640

zbMATH Keywords

rainbow colouringrainbow connection numberrainbow-connected graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Rainbow connection number of dense graphs
• Rainbow connection and minimum degree
• scientific article; zbMATH DE number 6837036
• Rainbow connection in graphs with minimum degree three
• Bounds for the rainbow connection number of graphs

Cited in

(16)

• Conflict-free connections of graphs
• On minimally rainbow k-connected graphs
• Minimum degree and size conditions for the proper connection number of graphs
• Conflict-free connection number and independence number of a graph
• Conflict-free connection number and size of graphs
• Rainbow connection number and graph operations
• Proper connection and size of graphs
• Rainbow connection for some families of hypergraphs
• Proper rainbow connection number of graphs
• Rainbow vertex connection number of dense and sparse graphs.
• Smallest k-rainbow connected graphs for large k
• Sufficient conditions for 2-rainbow connected graphs
• Graphs with rainbow connection number two
• Bounds for the rainbow connection number of graphs
• A note on the minimum size of k-rainbow-connected graphs
• Loose edge-connection of graphs

This page was built for publication: Rainbow connection in sparse graphs

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