Sequential coloring versus Welsh-Powell bound (Q1121275): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4065570 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3693257 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems / rank | |||
Normal rank | |||
Latest revision as of 15:33, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sequential coloring versus Welsh-Powell bound |
scientific article |
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
