The color cost of a caterpillar (Q1377806)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The color cost of a caterpillar
scientific article

    Statements

    The color cost of a caterpillar (English)
    0 references
    0 references
    0 references
    0 references
    6 May 1998
    0 references
    Using the positive integers as colours, the cost of a given vertex colouring of a graph is the sum of its colours. The colour cost of a graph is the smallest cost of any proper colouring of the graph. In this paper a fast algorithm is developed for calculating the colour cost of a caterpillar (that is, a tree whose square is Hamiltonian).
    0 references
    colour cost
    0 references
    caterpillar
    0 references
    0 references

    Identifiers