### 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 language | English |
---|---|

Pages (from-to) | 125-130 |

Number of pages | 6 |

Journal | Discrete Mathematics |

Volume | 174 |

Issue number | 1-3 |

Publication status | Published - Sep 15 1997 |

### Fingerprint

### Keywords

- Algorithm
- Caterpillar
- Coloring
- Tree

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Theoretical Computer Science

### Cite this

*Discrete Mathematics*,

*174*(1-3), 125-130.

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

Research output: Contribution to journal › Article

*Discrete Mathematics*, vol. 174, no. 1-3, pp. 125-130.

}

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 -