Title of article
Achromatic number of K5×Kn for large n
Author/Authors
Mirko Hor??k، نويسنده , , ?tefan P?ola، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
11
From page
159
To page
169
Abstract
Achromatic number of a graph G is a maximum number of colours in a proper vertex colouring of G such that vertices of any two distinct colour classes are joined by at least one edge. We determine the achromatic number of the Cartesian product of K5 and Kn for all n⩾25.
Keywords
Complete vertex colouring , Cartesian product , Achromatic number , Complete graph
Journal title
Discrete Mathematics
Serial Year
2001
Journal title
Discrete Mathematics
Record number
949678
Link To Document