Rainbow connection in oriented graphs

DOI10.1016/j.dam.2014.07.018zbMath1303.05099OpenAlexW2022874798MaRDI QIDQ477332

Ingo Schiermeyer, Paul Dorbec, Elżbieta Sidorowicz, Eric Sopena

Publication date: 3 December 2014

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

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

zbMATH Keywords

digraphstournamentsrainbow connection

Mathematics Subject Classification ID

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

Related Items (18)

Upper bounding rainbow connection number by forest number ⋮ The rainbow connection number of the power graph of a finite group ⋮ Distance-local rainbow connection number ⋮ Rainbow antistrong connection in tournaments ⋮ (Strong) proper vertex connection of some digraphs ⋮ Total rainbow connection of digraphs ⋮ Rainbow vertex connection of digraphs ⋮ Strong rainbow connection in digraphs ⋮ Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs ⋮ Rainbow connection numbers of Cayley digraphs on abelian groups ⋮ Rainbow connection in some digraphs ⋮ Complexity of rainbow vertex connectivity problems for restricted graph classes ⋮ Monochromatic connecting colorings in strongly connected oriented graphs ⋮ Proper connection and proper-walk connection of digraphs ⋮ Rainbow connections in digraphs ⋮ Rainbow connectivity of cacti and of some infinite digraphs ⋮ On various (strong) rainbow connection numbers of graphs ⋮ (Strong) total proper connection of some digraphs

Cites Work

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