The achromatic number of K_{6} □ K_{7} is 18
A vertex colouring \(f:V(G)\to C\) of a graph \(G\) is complete if for any two distinct colours \(c_1, c_2 \in C\) there is an edge \(\{v_1,v_2\}\in E(G)\) such that \(f(v_i)=c_i\), \(i=1,2\). The achromatic number of \(G\) is the maximum number \(\text{achr}(G)\) of colours in a proper complete ver...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH Univeristy of Science and Technology Press
2021-03-01
|
| Series: | Opuscula Mathematica |
| Subjects: | |
| Online Access: | https://www.opuscula.agh.edu.pl/vol41/2/art/opuscula_math_4108.pdf |