Rainbow vertex \(k\)-connection in graphs
From MaRDI portal
Publication:2444548
DOI10.1016/j.dam.2013.04.025zbMath1285.05066OpenAlexW1975518441MaRDI QIDQ2444548
Henry Liu, Ângela Mestre, Teresa Sousa
Publication date: 10 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.04.025
Related Items
Total monochromatic connection of graphs, Some results on the 3-total-rainbow index, Total rainbow \(k\)-connection in graphs, On (strong) proper vertex-connection of graphs, Rainbow vertex connection of digraphs, The vertex-rainbow connection number of some graph operations, Hardness result for the total rainbow \(k\)-connection of graphs, Generalized rainbow connection of graphs, Some results on the 3-vertex-rainbow index of a graph, On various (strong) rainbow connection numbers of graphs, Conflict-free vertex-connections of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Rainbow connections of graphs: a survey
- On the rainbow vertex-connection
- Note on the Rainbow $k$-Connectivity of Regular Complete Bipartite Graphs
- The rainbow connectivity of a graph
- The rainbow $k$-connectivity of two classes of graphs
- Rainbow connection in graphs
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- The strong rainbow vertex-connection of graphs