The color cost of a caterpillar

Mario Gionfriddo, Frank Harary, Z. Tuza

Research output: Article

3 Citations (Scopus)

Abstract

Using the positive integers as colors, the cost of a given coloring of the nodes of a graph G is the sum of its colors. The color cost of G is then the smallest cost of any proper coloring of G. We specify three types of caterpillar using their codes. These specifications enable the representation of an arbitrary caterpillar as a sequence of these types. The representation is utilized to develop a fast algorithm for calculating the color cost of a given caterpillar.

Original languageEnglish
Pages (from-to)125-130
Number of pages6
JournalDiscrete Mathematics
Volume174
Issue number1-3
Publication statusPublished - szept. 15 1997

Fingerprint

Caterpillar
Color
Costs
Coloring
Colouring
Fast Algorithm
Specification
Specifications
Integer
Arbitrary
Graph in graph theory
Vertex of a graph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Gionfriddo, M., Harary, F., & Tuza, Z. (1997). The color cost of a caterpillar. Discrete Mathematics, 174(1-3), 125-130.

The color cost of a caterpillar. / Gionfriddo, Mario; Harary, Frank; Tuza, Z.

In: Discrete Mathematics, Vol. 174, No. 1-3, 15.09.1997, p. 125-130.

Research output: Article

Gionfriddo, M, Harary, F & Tuza, Z 1997, 'The color cost of a caterpillar', Discrete Mathematics, vol. 174, no. 1-3, pp. 125-130.
Gionfriddo M, Harary F, Tuza Z. The color cost of a caterpillar. Discrete Mathematics. 1997 szept. 15;174(1-3):125-130.
Gionfriddo, Mario ; Harary, Frank ; Tuza, Z. / The color cost of a caterpillar. In: Discrete Mathematics. 1997 ; Vol. 174, No. 1-3. pp. 125-130.
@article{555e4de1e9dc4072bf65e0bb0522de88,
title = "The color cost of a caterpillar",
abstract = "Using the positive integers as colors, the cost of a given coloring of the nodes of a graph G is the sum of its colors. The color cost of G is then the smallest cost of any proper coloring of G. We specify three types of caterpillar using their codes. These specifications enable the representation of an arbitrary caterpillar as a sequence of these types. The representation is utilized to develop a fast algorithm for calculating the color cost of a given caterpillar.",
keywords = "Algorithm, Caterpillar, Coloring, Tree",
author = "Mario Gionfriddo and Frank Harary and Z. Tuza",
year = "1997",
month = "9",
day = "15",
language = "English",
volume = "174",
pages = "125--130",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - The color cost of a caterpillar

AU - Gionfriddo, Mario

AU - Harary, Frank

AU - Tuza, Z.

PY - 1997/9/15

Y1 - 1997/9/15

N2 - Using the positive integers as colors, the cost of a given coloring of the nodes of a graph G is the sum of its colors. The color cost of G is then the smallest cost of any proper coloring of G. We specify three types of caterpillar using their codes. These specifications enable the representation of an arbitrary caterpillar as a sequence of these types. The representation is utilized to develop a fast algorithm for calculating the color cost of a given caterpillar.

AB - Using the positive integers as colors, the cost of a given coloring of the nodes of a graph G is the sum of its colors. The color cost of G is then the smallest cost of any proper coloring of G. We specify three types of caterpillar using their codes. These specifications enable the representation of an arbitrary caterpillar as a sequence of these types. The representation is utilized to develop a fast algorithm for calculating the color cost of a given caterpillar.

KW - Algorithm

KW - Caterpillar

KW - Coloring

KW - Tree

UR - http://www.scopus.com/inward/record.url?scp=1642323258&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1642323258&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:1642323258

VL - 174

SP - 125

EP - 130

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -