1 paper · 1 filter
Xingchao Deng, Hengzhe Li, Guiying Yan
In this paper, we consider rainbow connection number of maximal outerplanar graphs(MOPs) on algorithmic aspect. For the (MOP) G, we give sufficient conditions to guarantee that $…