(1, 2)-rainbow connection number at most 3 in connected dense graphs
From MaRDI portal
Publication:6090318
Recommendations
- (Strong) rainbow connection number of three classes of graphs
- Rainbow connection number of dense graphs
- Note on the rainbow connection number of dense graphs
- Rainbow \(k\)-connection in dense graphs
- Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
- Rainbow connection in graphs with minimum degree three
- Rainbow connection number of graphs with diameter 3
- Rainbow \(k\)-connection in dense graphs (extended abstract)
- The rainbow connection number of 2-connected graphs
- A sharp upper bound for the rainbow 2-connection number of a 2-connected graph
Cites work
- Color code techniques in rainbow connection
- Color connection in graphs intermediate to proper and rainbow connection
- Generalized rainbow connection of graphs
- Generalized rainbow connection of graphs and their complements
- Hardness and algorithms for rainbow connection
- Hardness results for three kinds of colored connections of graphs
- Maximal circuits of graphs. I
- On proper-path colorings in graphs
- On the minimum degree and the proper connection number of graphs
- Proper connection number 2, connectivity, and forbidden subgraphs
- Proper connection of graphs
- Rainbow connection in graphs
- Rainbow connection number of comb product of graphs
- The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths
This page was built for publication: (1, 2)-rainbow connection number at most 3 in connected dense graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090318)
