Rainbow connection number and graph operations

DOI10.1016/j.dam.2017.06.004zbMath1368.05121OpenAlexW2734657833MaRDI QIDQ2399294

Yingbin Ma, Hengzhe Li

Publication date: 22 August 2017

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

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

zbMATH Keywords

edge-coloringrainbow connection numbergraph operation

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (5)

Some results on the total proper \(k\)-connection number ⋮ Some results on the 3-total-rainbow index ⋮ The vertex-rainbow connection number of some graph operations ⋮ Some results on the 3-vertex-rainbow index of a graph ⋮ Note on the vertex-rainbow index of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Rainbow connections for outerplanar graphs with diameter 2 and 3
• The minimum size of \(k\)-rainbow connected graphs of given order
• A note on the minimum size of \(k\)-rainbow-connected graphs
• Rainbow connection of graphs with diameter 2
• Rainbow connection number of graph power and graph products
• Hardness and algorithms for rainbow connection
• Rainbow connection number and radius
• Note on minimally \(d\)-rainbow connected graphs
• Rainbow connections of graphs: a survey
• On minimally rainbow \(k\)-connected graphs
• Rainbow connection and graph products
• New Hardness Results in Rainbow Connectivity
• Rainbow Colouring of Split and Threshold Graphs
• Rainbow connection in graphs
• Oriented diameter and rainbow connection number of a graph

This page was built for publication: Rainbow connection number and graph operations