On the mean chromatic number (Q1322240): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Timothy R. S. Walsh / rank | |||
Property / reviewed by | |||
Property / reviewed by: Timothy R. S. Walsh / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The mean chromatic number of paths and cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3035310 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Question of Protocol / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Coloring Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On-line and first fit colorings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Linearity of First-Fit Coloring of Interval Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3686952 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 15:32, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the mean chromatic number |
scientific article |
Statements
On the mean chromatic number (English)
0 references
15 September 1994
0 references
From the article: ``Taking the colors to be the positive integers, the greedy vertex-coloring algorithm can be described as follows. The vertices of a graph \(G\) are ordered and the algorithm assigns colors to the vertices in that order, giving each vertex the first ... color which has not already been assigned to a vertex adjacent to it.'' The article cites results from the literature about the worst case performance of this algorithm and then discusses its average-case performance (over all vertex-orders) for two families of graphs: cocktail party graphs \((K_{n,n}\) with a 1-factor removed) and even cycles. A formula is given for the proportion of orders for which the greedy algorithm will use at least \(i\) colors too many, and asymptotic results are given which show that the number of colors used tends to 2 for the cocktail party graphs and to 3 for even cycles.
0 references
mean chromatic number
0 references
greedy vertex-coloring algorithm
0 references
cocktail party graphs
0 references
even cycles
0 references