On minimal neighbourhood-connected graphs (Q1182928)

The closed neighbourhood of a vertex \(u\) of a graph \(G\) is the subset \(u^*\) of all vertices adjacent to \(u\) plus \(u\). \(G\) is called neighbourhood-connected if it is connected and \(G-u^*\) is connected but not complete, for all \(u\) in \(G\), see \textit{A. Meir} and \textit{J. W. Moon} [Graphs Comb. 4, No. 1, 49-65 (1988; Zbl 0647.05019)]. Here the authors characterize neighbourhood-connected graphs \(G\) for which all \(G-u^*\) are minimally \(k\)-connected, \(k=1,2,3\), and \(G-u^*\) is a cycle, wheel or tree.