- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs ; volume:68 ; number:2 ; day:23 ; month:2 ; year:2024 ; pages:250-270 ; date:4.2024
Theory of computing systems ; 68, Heft 2 (23.2.2024), 250-270, 4.2024
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00224-024-10161-3
- URN
-
urn:nbn:de:101:1-2406211144118.501315171357
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:52 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Le, Hoang-Oanh
- Le, Van Bang
- SpringerLink (Online service)
Other Objects (12)
Critical vertices in k-connected digraphs
Vertex Deletion into Bipartite Permutation Graphs
On Vertex-Edge-Critically n-Connected Graphs
Deletion of a vertex in even sum domination
Vertex Deletion Problems : A Parameterized Point of View
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
An Anionic Amido‐Substituted Seven‐Vertex Siliconoid Cluster
On Vertices of Degree n in Minimally n-Edge-Connected Graphs
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size
The Complexity of Optimal Design of Temporally Connected Graphs
Vertex
From spin vertex to string vertex
Critical vertices in k-connected digraphs
Vertex Deletion into Bipartite Permutation Graphs
On Vertex-Edge-Critically n-Connected Graphs
Deletion of a vertex in even sum domination
Vertex Deletion Problems : A Parameterized Point of View
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
An Anionic Amido‐Substituted Seven‐Vertex Siliconoid Cluster
On Vertices of Degree n in Minimally n-Edge-Connected Graphs
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size
The Complexity of Optimal Design of Temporally Connected Graphs
Vertex
From spin vertex to string vertex
Critical vertices in k-connected digraphs
Vertex Deletion into Bipartite Permutation Graphs
On Vertex-Edge-Critically n-Connected Graphs
Deletion of a vertex in even sum domination
Vertex Deletion Problems : A Parameterized Point of View
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
An Anionic Amido‐Substituted Seven‐Vertex Siliconoid Cluster
On Vertices of Degree n in Minimally n-Edge-Connected Graphs
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size
The Complexity of Optimal Design of Temporally Connected Graphs
Vertex