Rainbow vertex connection of digraphs
From MaRDI portal
Publication:1698060
DOI10.1007/s10878-017-0156-7zbMath1386.05077arXiv1701.04280OpenAlexW2963696160MaRDI QIDQ1698060
Publication date: 21 February 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.04280
Related Items (16)
Some results on the total proper \(k\)-connection number ⋮ Some results on the 3-total-rainbow index ⋮ Rainbow antistrong connection in tournaments ⋮ (Strong) proper vertex connection of some digraphs ⋮ On the complexity of \(k\)-rainbow cycle colouring problems ⋮ Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\) ⋮ Rainbow connection numbers of Cayley digraphs on abelian groups ⋮ Proper connection and proper-walk connection of digraphs ⋮ Rainbow connections in digraphs ⋮ The generalized 3-connectivity of the Mycielskian of a graph ⋮ Minimum degree and size conditions for the proper connection number of graphs ⋮ Some results on the 3-vertex-rainbow index of a graph ⋮ On various (strong) rainbow connection numbers of graphs ⋮ Total rainbow connection numbers of some special graphs ⋮ Note on directed proper connection number of a random graph ⋮ (Strong) total proper connection of some digraphs
Cites Work
- Unnamed Item
- Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
- Rainbow connection in oriented graphs
- 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
- Rainbow connections of graphs: a survey
- Rainbow vertex \(k\)-connection in graphs
- On the rainbow vertex-connection
- Rainbow connection in graphs
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- Hardness and Algorithms for Rainbow Connectivity
- The strong rainbow vertex-connection of graphs
This page was built for publication: Rainbow vertex connection of digraphs
