"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.48550/ARXIV.2402.04931

access: open

type: Informal or Other Publication

metadata version: 2024-02-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2402-04931
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2402-04931
Hoàng-Oanh Le, Van Bang Le:
Complexity of the (Connected) Cluster Vertex Deletion problem on H-free graphs. CoRR abs/2402.04931 (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.