Complexity of the cluster vertex deletion problem on H-free graphs

DOI10.4230/LIPICS.MFCS.2022.68MaRDI QIDQ6584072zbMATH OpenFDO

Authors Hoàng-Oanh Le, Bang le van

Publication date 6 August 2024

zbMATH Keywords

computational complexitycluster vertex deletioncomplexity dichotomyvertex cover

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(1)

• The complexity of \((P_k, P_\ell ) \)-arrowing

This page was built for publication: Complexity of the cluster vertex deletion problem on \(H\)-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584072)