Complexity results for well‐covered graphs (Q3993632)
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: Complexity results for well‐covered graphs |
scientific article; zbMATH DE number 39777
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity results for well‐covered graphs |
scientific article; zbMATH DE number 39777 |
Statements
Complexity results for well‐covered graphs (English)
0 references
23 July 1992
0 references
algorithmic complexity
0 references
well-covered graph recognition
0 references
Hamiltonian cycle
0 references
clique partition
0 references
dominating set
0 references
0 references
0.91993046
0 references
0 references
0.9165908
0 references
