On the cost-chromatic number of graphs (Q1363702): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q1297762 |
||
Property / reviewed by | |||
Property / reviewed by: Chris Jagger / rank | |||
Revision as of 18:34, 22 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the cost-chromatic number of graphs |
scientific article |
Statements
On the cost-chromatic number of graphs (English)
0 references
10 August 1997
0 references
The authors consider vertex colourings in which each colour has an associated cost, incurred each time the colour is assigned to a vertex. The cost-chromatic number of a graph with respect to a cost set is the minimum number of colours necessary to produce a colouring of the graph with minimum total cost. Upper bounds are established for the cost-chromatic number, and it is shown that trees and planar blocks can have arbitrarily large cost-chromatic number. Also, it is shown that the cost-chromatic number is not monotonic with subgraph inclusion.
0 references
vertex colourings
0 references
cost-chromatic number
0 references