Rainbow connection of bridgeless outerplanar graphs with small diameters
Abstract
In this paper, we investigate rainbow connection number rc(G) of bridgeless outerplanar graphs G with diameter 2 or 3. We proved the following results: If G has diameter 2, then rc(G)=3 for fan graphs Fn with n≥ 7 or C5, otherwise rc(G)=2; if G has diameter 3, then rc(G)≤ 4 and the bound is sharp.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.