Strong rainbow connection in digraphs

DOI10.1016/J.DAM.2017.12.017zbMath1380.05090OpenAlexW2417258941MaRDI QIDQ1701123

Elżbieta Sidorowicz, Eric Sopena

Publication date: 22 February 2018

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

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

zbMATH Keywords

digraphstournamentsstrong rainbow connection

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (4)

(Strong) proper vertex connection of some digraphs ⋮ Total rainbow connection of digraphs ⋮ Proper connection and proper-walk connection of digraphs ⋮ Rainbow connections in digraphs

Cites Work

• Unnamed Item
• The rainbow connection number of 2-connected graphs
• Rainbow connection in oriented graphs
• Hardness and algorithms for rainbow connection
• Rainbow connection in some digraphs
• Rainbow connectivity of cacti and of some infinite digraphs
• On rainbow connection
• Rainbow connections of graphs: a survey
• On minimally rainbow \(k\)-connected graphs
• Rainbow connection and minimum degree
• New Hardness Results in Rainbow Connectivity
• 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: Strong rainbow connection in digraphs