Rainbow connection and minimum degree

DOI10.1016/j.dam.2011.10.009zbMath1287.05047OpenAlexW2039832814MaRDI QIDQ2446307

Ingo Schiermeyer

Publication date: 16 April 2014

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

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

zbMATH Keywords

edge colouringrainbow connected

Mathematics Subject Classification ID

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

Related Items (6)

Tight upper bound of the rainbow vertex-connection number for 2-connected graphs ⋮ Strong rainbow connection in digraphs ⋮ Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\) ⋮ Rainbow connection in oriented graphs ⋮ Rainbow connection in some digraphs ⋮ Rainbow connections in digraphs

Cites Work

• Unnamed Item
• On rainbow connection
• Graphs with rainbow connection number two
• Rainbow connection in graphs
• Rainbow Connection in Graphs with Minimum Degree Three
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree

This page was built for publication: Rainbow connection and minimum degree