Rainbow connection number and graph operations
From MaRDI portal
Publication:2399294
DOI10.1016/J.DAM.2017.06.004zbMATH Open1368.05121OpenAlexW2734657833MaRDI QIDQ2399294FDOQ2399294
Authors: Hengzhe Li, Yingbin Ma 
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
Recommendations
Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Graph theory
- Rainbow connection in graphs
- Hardness and algorithms for rainbow connection
- Rainbow connections for outerplanar graphs with diameter 2 and 3
- On minimally rainbow \(k\)-connected graphs
- Rainbow connection of graphs with diameter 2
- Rainbow connectivity: hardness and tractability
- Rainbow connection number and radius
- Rainbow connection and graph products
- Rainbow Colouring of Split and Threshold Graphs
- Rainbow connection numbers of line graphs.
- Rainbow connection number of graph power and graph products
- The minimum size of \(k\)-rainbow connected graphs of given order
- A note on the minimum size of \(k\)-rainbow-connected graphs
- Note on minimally \(d\)-rainbow connected graphs
- Oriented diameter and rainbow connection number of a graph
Cited In (8)
- Rainbow connection number of graphs with diameter 3
- Some results on the total proper \(k\)-connection number
- Some results on the 3-total-rainbow index
- Rainbow connection number of amalgamation of some graphs
- Some results on the 3-vertex-rainbow index of a graph
- Note on the vertex-rainbow index of a graph
- The vertex-rainbow connection number of some graph operations
- Rainbow connection number of graph power and graph products
This page was built for publication: Rainbow connection number and graph operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399294)
