Complexity results for well‐covered graphs (Q3993632)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity results for well‐covered graphs |
scientific article |
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
