1. Achromatic number of $K_5 \times K_n$ for small $n$
- Creator:
- Horňák, Mirko and Pčola, Štefan
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- complete vertex colouring, achromatic number, Cartesian product, and complete graph
- Language:
- English
- 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$.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public