Coloring vertices and edges of a graph by nonempty subsets of a set (Q2430971)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5876838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring vertices and edges of a graph by nonempty subsets of a set |
scientific article; zbMATH DE number 5876838 |
Statements
Coloring vertices and edges of a graph by nonempty subsets of a set (English)
0 references
8 April 2011
0 references
strongly set colorable graph
0 references
0.8982987999916077
0 references
0.8763706684112549
0 references
0.8742986917495728
0 references
0.8226155042648315
0 references
