On the cost chromatic number of outerplanar, planar, and line graphs
Discussiones Mathematicae. Graph Theory, Tome 17 (1997) no. 2, pp. 229-241

Voir la notice de l'article provenant de la source Library of Science

We consider vertex colorings of graphs in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of the coloring is the sum of the costs incurred at each vertex. The cost chromatic number of a graph with respect to a cost set is the minimum number of colors necessary to produce a minimum cost coloring of the graph. We show that the cost chromatic number of maximal outerplanar and maximal planar graphs can be arbitrarily large and construct several infinite classes of counterexamples to a conjecture of Harary and Plantholt on the cost chromatic number of line graphs.
Keywords: cost coloring, outerplanar, planar, line graphs
@article{DMGT_1997_17_2_a1,
     author = {Mitchem, John and Morriss, Patrick and Schmeichel, Edward},
     title = {On the cost chromatic number of outerplanar, planar, and line graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {229--241},
     publisher = {mathdoc},
     volume = {17},
     number = {2},
     year = {1997},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_1997_17_2_a1/}
}
TY  - JOUR
AU  - Mitchem, John
AU  - Morriss, Patrick
AU  - Schmeichel, Edward
TI  - On the cost chromatic number of outerplanar, planar, and line graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 1997
SP  - 229
EP  - 241
VL  - 17
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_1997_17_2_a1/
LA  - en
ID  - DMGT_1997_17_2_a1
ER  - 
%0 Journal Article
%A Mitchem, John
%A Morriss, Patrick
%A Schmeichel, Edward
%T On the cost chromatic number of outerplanar, planar, and line graphs
%J Discussiones Mathematicae. Graph Theory
%D 1997
%P 229-241
%V 17
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_1997_17_2_a1/
%G en
%F DMGT_1997_17_2_a1
Mitchem, John; Morriss, Patrick; Schmeichel, Edward. On the cost chromatic number of outerplanar, planar, and line graphs. Discussiones Mathematicae. Graph Theory, Tome 17 (1997) no. 2, pp. 229-241. http://geodesic.mathdoc.fr/item/DMGT_1997_17_2_a1/