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]
@inproceedings{0002PP18-0, title = {Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs}, author = {Matthew Johnson 0002 and Giacomo Paesani and Daniël Paulusma}, year = {2018}, doi = {10.1007/978-3-030-00256-5_23}, url = {https://doi.org/10.1007/978-3-030-00256-5_23}, researchr = {https://researchr.org/publication/0002PP18-0}, cites = {0}, citedby = {0}, pages = {279-291}, booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings}, editor = {Andreas Brandstädt and Ekkehard Köhler and Klaus Meer}, volume = {11159}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-030-00256-5}, }