A Locally Connected Spanning Tree Can Be Found in Polynomial Time on Simple Clique 3-Trees. - Tiziana Calamoneri; Matteo Dell'Orefice; Angelo Monti (ICTCS, 2016)

A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs. - Tiziana Calamoneri; Matteo Dell'Orefice; Angelo Monti (Theor. Comput. Sci., 2019)