Rainbow connections for outerplanar graphs with diameter 2 and 3

Abstract

An edge-colored graph G is rainbow connected if every two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted by rcðGÞ, is the smallest number of colors that are needed in order to make G rainbow connected. It was proved that computing rcðGÞ is an NP-hard problem, as well as that… (More)
DOI: 10.1016/j.amc.2014.05.066

1 Figure or Table

Topics

  • Presentations referencing similar topics