Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
Crossref DOI link: https://doi.org/10.1007/s00224-024-10161-3
Published Online: 2024-02-23
Published Print: 2024-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Le, Hoang-Oanh
Le, Van Bang
Funding for this research was provided by:
Universität Rostock
Text and Data Mining valid from 2024-02-23
Version of Record valid from 2024-02-23
Article History
Accepted: 8 January 2024
First Online: 23 February 2024
Declarations
:
: The authors declare no competing interests.