Graph sandwich problem for the property of being well-covered and partitionable into \(k\) independent sets and \(\ell\) cliques (Q2081655)
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: Graph sandwich problem for the property of being well-covered and partitionable into \(k\) independent sets and \(\ell\) cliques |
scientific article; zbMATH DE number 7600805
| 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; zbMATH DE number 7600805 |
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
