On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On computing the minimum 3-path vertex cover and dissociation number of graphs |
scientific article; zbMATH DE number 5987018
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On computing the minimum 3-path vertex cover and dissociation number of graphs |
scientific article; zbMATH DE number 5987018 |
Statements
On computing the minimum 3-path vertex cover and dissociation number of graphs (English)
0 references
7 December 2011
0 references
path vertex cover
0 references
dissociation number
0 references
approximation
0 references
