Bounds for the rainbow connection number of graphs
From MaRDI portal
Publication:3089362
Recommendations
Cited in
(27)- scientific article; zbMATH DE number 6719578 (Why is no real title available?)
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- Color code techniques in rainbow connection
- A sharp upper bound for the rainbow 2-connection number of a 2-connected graph
- Upper bound involving parameter _2 for the rainbow connection number
- On rainbow connection
- Rainbow connection number, bridges and radius
- Upper bounding rainbow connection number by forest number
- (Strong) rainbow connection on the splitting of 3-path
- Rainbow connection in graphs with minimum degree three
- Rainbow Connection Numbers for Undirected Double-Loop Networks
- Upper bounds for the total rainbow connection of graphs
- Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
- Rainbow connection and minimum degree
- Distance-local rainbow connection number
- The k-rainbow bondage number of a graph
- scientific article; zbMATH DE number 6837036 (Why is no real title available?)
- Rainbow connection for some families of hypergraphs
- Rainbow connection number and independence number of a graph
- Rainbow vertex-connection and graph products
- Rainbow connection in some digraphs
- A sharp upper bound for the strong rainbow connection number of a graph
- Rainbow connection number of corona product of graphs
- Rainbow connection number of dense graphs
- Rainbow connection in sparse graphs
- Rainbow connection and graph products
- Rainbow connectivity and rainbow criticality on graph classes
This page was built for publication: Bounds for the rainbow connection number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3089362)