Graph sandwich problem for the property of being well-covered and partitionable into \(k\) independent sets and \(\ell\) cliques (Q2081655)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph sandwich problem for the property of being well-covered and partitionable into \(k\) independent sets and \(\ell\) cliques |
scientific article |
Statements
Graph sandwich problem for the property of being well-covered and partitionable into \(k\) independent sets and \(\ell\) cliques (English)
0 references
13 October 2022
0 references
well-covered
0 references
\((k,\ell)\)-graph
0 references
sandwich problem
0 references
recognition
0 references
