Enumerating maximal independent sets with applications to graph colouring. (Q703280)
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: Enumerating maximal independent sets with applications to graph colouring. |
scientific article; zbMATH DE number 2125919
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerating maximal independent sets with applications to graph colouring. |
scientific article; zbMATH DE number 2125919 |
Statements
Enumerating maximal independent sets with applications to graph colouring. (English)
0 references
11 January 2005
0 references
Maximal independent set
0 references
Graph colouring
0 references
Chromatic number
0 references
Graph algorithms
0 references
Extremal graphs
0 references
0.8748383522033691
0 references
0.8735041618347168
0 references
0.8726504445075989
0 references
