Partitions and well-coveredness: the graph sandwich problem (Q2111912)
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: Partitions and well-coveredness: the graph sandwich problem |
scientific article; zbMATH DE number 7643127
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitions and well-coveredness: the graph sandwich problem |
scientific article; zbMATH DE number 7643127 |
Statements
Partitions and well-coveredness: the graph sandwich problem (English)
0 references
17 January 2023
0 references
well-covered
0 references
\((k, \ell)\)-graph
0 references
sandwich problem
0 references
recognition
0 references
0 references
0.93855965
0 references
0.9091811
0 references
0 references
0.89595896
0 references
0 references
0.8919183
0 references
0.88712275
0 references
0.8825919
0 references
