Rainbow connections in digraphs
From MaRDI portal
Publication:1752466
DOI10.1016/J.DAM.2018.01.014zbMath1387.05105OpenAlexW2791262496WikidataQ130069432 ScholiaQ130069432MaRDI QIDQ1752466
Elżbieta Sidorowicz, Eric Sopena
Publication date: 24 May 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.01.014
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items (2)
(Strong) proper vertex connection of some digraphs ⋮ Proper connection and proper-walk connection of digraphs
Cites Work
- Unnamed Item
- Hardness results for total rainbow connection of graphs
- The rainbow connection number of 2-connected graphs
- Total rainbow \(k\)-connection in 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
- The complexity of determining the rainbow vertex-connection of a graph
- On rainbow connection
- Total rainbow connection of digraphs
- Rainbow vertex connection of digraphs
- Strong rainbow connection in digraphs
- Rainbow connections of graphs: a survey
- 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: Rainbow connections in digraphs
