Sufficient conditions for 2-rainbow connected graphs

DOI10.1016/J.DAM.2015.10.025zbMath1339.05139OpenAlexW2100509599MaRDI QIDQ298982

Ingo Schiermeyer, Arnfried Kemnitz

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)

Cites Work

• Unnamed Item
• On rainbow connection
• Rainbow connection number of dense graphs
• Rainbow connection in sparse graphs
• Graphs with rainbow connection number two
• Rainbow connection in graphs
• Rainbow Connection in Graphs with Minimum Degree Three
• On Representatives of Subsets
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• Hardness and Algorithms for Rainbow Connectivity

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