Sequential coloring versus Welsh-Powell bound (Q1121275)
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: Sequential coloring versus Welsh-Powell bound |
scientific article; zbMATH DE number 4103093
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sequential coloring versus Welsh-Powell bound |
scientific article; zbMATH DE number 4103093 |
Statements
Sequential coloring versus Welsh-Powell bound (English)
0 references
1989
0 references
In this note some remarks are made on the relations between chromatic number, the number of colors used by the sequential coloring algorithm and the Welsh-Powell upper bound for the chromatic number of a graph.
0 references
chromatic number
0 references
sequential coloring algorithm
0 references
Welsh-Powell upper bound
0 references
0.90172637
0 references
0.8994035
0 references
0.89197576
0 references
0 references
0 references
0 references
0.87001646
0 references
0.8631034
0 references
