Recommendations
Cites work
- scientific article; zbMATH DE number 3303831 (Why is no real title available?)
- Graph theory
- Graphs with rainbow connection number two
- Hardness and algorithms for rainbow connection
- On minimally rainbow \(k\)-connected graphs
- On rainbow connection
- Rainbow connection and minimum degree
- Rainbow connection in graphs
- Rainbow connection in graphs with minimum degree three
- The rainbow connection number of 2-connected graphs
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- The rainbow connectivity of a graph
Cited in
(24)- Oriented diameter and rainbow connection number of a graph
- Note on rainbow connection in oriented graphs with diameter 2
- Rainbow connection numbers of Cayley digraphs on abelian groups
- Rainbow vertex connection of digraphs
- Rainbow connections in digraphs
- The rainbow connection number of the power graph of a finite group
- Rainbow vertex coloring bipartite graphs and chordal graphs
- (Strong) proper vertex connection of some digraphs
- Upper bounding rainbow connection number by forest number
- Proper connection and proper-walk connection of digraphs
- On rainbow connection of digraphs with diameter 2
- Some results on (strong) total proper connection number of some digraphs
- Rainbow antistrong connection in tournaments
- (Strong) total proper connection of some digraphs
- Distance-local rainbow connection number
- On the rainbow vertex-connection
- Rainbow connection in some digraphs
- Complexity of rainbow vertex connectivity problems for restricted graph classes
- Total rainbow connection of digraphs
- Strong rainbow connection in digraphs
- Monochromatic connecting colorings in strongly connected oriented graphs
- Rainbow connection number of corona product of graphs
- On various (strong) rainbow connection numbers of graphs
- Rainbow connectivity of cacti and of some infinite digraphs
This page was built for publication: Rainbow connection in oriented graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477332)