Achromatic number of $K_5 \times K_n$ for small $n$

Title:

Achromatic number of $K_5 \times K_n$ for small $n$

Creator:

Horňák, Mirko and Pčola, Štefan

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:156db800-5923-4647-8df7-4f5a16d595b4
uuid:156db800-5923-4647-8df7-4f5a16d595b4

Subject:

complete vertex colouring, achromatic number, Cartesian product, and complete graph

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

The achromatic number of a graph $G$ is the maximum number of colours in a proper vertex colouring of $G$ such that for any two distinct colours there is an edge of $G$ incident with vertices of those two colours. We determine the achromatic number of the Cartesian product of $K_5$ and $K_n$ for all $n \le 24$.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

963-988

Source:

Czechoslovak Mathematical Journal | 2003 Volume:53 | Number:4

Harvested from:

CDK

Metadata only:

false