Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma. Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs. In Andreas Brandstädt, Ekkehard Köhler, Klaus Meer, editors, Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings. Volume 11159 of Lecture Notes in Computer Science, pages 279-291, Springer, 2018. [doi]
Abstract is missing.