Some Bounds on the Rainbow Connection Number of 3-, 4- and 5-connected Graphs

TL;DR

This paper establishes upper bounds on the rainbow connection number for 3- and 4-connected graphs with large diameter and for maximal planar graphs, confirming a conjecture for these classes.

Contribution

It provides new bounds on the rainbow connection number for specific graph classes, including large diameter and maximal planar graphs, advancing understanding in graph connectivity.

Findings

For 3- and 4-connected graphs, $rc(G) \

rc(G) \

Proves a conjecture for large diameter and maximal planar graphs.

Abstract

The rainbow connection number, $rc(G)$, of a connected graph $G$ is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same. We show that for $\kappa =3$ or $\kappa = 4$, every $\kappa$-connected graph $G$ on $n$ vertices with diameter $\frac{n}{\kappa}-c$ satisfies $rc(G) \leq \frac{n}{\kappa} + 15c + 18$. We also show that for every maximal planar graph $G$, $rc(G) \leq \frac{n}{\kappa} + 36$. This proves a conjecture of Li et al. for graphs with large diameter and maximal planar graphs.