Unique intersectability of diamond-free graphs (Q534340)
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: Unique intersectability of diamond-free graphs |
scientific article; zbMATH DE number 5895538
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unique intersectability of diamond-free graphs |
scientific article; zbMATH DE number 5895538 |
Statements
Unique intersectability of diamond-free graphs (English)
0 references
17 May 2011
0 references
set representation
0 references
uniquely intersectable
0 references
clique partition
0 references
diamond-free graphs
0 references
0 references
0.8935263
0 references
0 references
0.8687029
0 references
0.86773205
0 references
0.8644378
0 references
