"Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free ..."

Hoàng-Oanh Le, Van Bang Le (2024)

> Home

Details and statistics

DOI: 10.1007/S00224-024-10161-3

access: open

type: Journal Article

metadata version: 2024-10-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/mst/LeL24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/LeL24
Hoàng-Oanh Le, Van Bang Le:
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs. Theory Comput. Syst. 68(2): 250-270 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.