Strong cliques in diamond-free graphs (Q5919069)
From MaRDI portal
scientific article; zbMATH DE number 7305079
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong cliques in diamond-free graphs |
scientific article; zbMATH DE number 7305079 |
Statements
Strong cliques in diamond-free graphs (English)
0 references
3 February 2021
0 references
maximal clique
0 references
maximal stable set
0 references
diamond-free graph
0 references
strong clique
0 references
simplicial clique
0 references
strongly perfect graph
0 references
CIS graph
0 references
NP-hard problem
0 references
polynomial-time algorithm
0 references
Erdős-Hajnal property
0 references
0 references
0 references
0 references
0 references
