Sufficient conditions for 2-rainbow connected graphs

DOI10.1016/J.DAM.2015.10.025MaRDI QIDQ298982zbMATH OpenOpenAlexFDO

Authors Arnfried Kemnitz, Ingo Schiermeyer

Publication date 21 June 2016

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

Full work available at URL https://doi.org/10.1016/j.dam.2015.10.025

zbMATH Keywords

rainbow colouringrainbow connected

Mathematics Subject Classification ID

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

Recommendations

• Graphs with rainbow connection number two
• A sharp upper bound for the rainbow 2-connection number of a 2-connected graph
• The rainbow connection number of 2-connected graphs
• On rainbow connection
• Hardness and algorithms for rainbow connection

Cites work

• Graph theory
• Graphs with rainbow connection number two
• Hardness and Algorithms for Rainbow Connectivity
• On Representatives of Subsets
• On rainbow connection
• Rainbow connection in graphs
• Rainbow connection in graphs with minimum degree three
• Rainbow connection in sparse graphs
• Rainbow connection number of dense graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree

Cited in

(1)

• Graphs with rainbow connection number two

This page was built for publication: Sufficient conditions for 2-rainbow connected graphs

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