Learn More
A graph G is called an outerplanar graph if it has an embedding in the plane such that every ver-tex lies on the boundary of the exterior face. In this paper, we show that the rankwidth of a bicon-nected outerplanar graph is at most two. Further, we propose a linear-time algorithm to construct an optimal rank-decomposition tree for a biconnected outerplanar(More)
  • 1