On the achromatic number of the Cartesian product of two complete graphs

preprint2022arXivOpen access

Abstract

A vertex colouring f:V(G)→Cf:V(G)\to C of a graph GG is complete if for any c1,c2∈Cc_1,c_2\in C with c1≠c2c_1\ne c_2 there are in GG adjacent vertices v1,v2v_1,v_2 such that f(v1)=c1f(v_1)=c_1 and f(v2)=c2f(v_2)=c_2. The achromatic number of GG is the maximum number achr(G)\mathrm{achr}(G) of colours in a proper complete vertex colouring of GG. Let G1□G2G_1\square G_2 denote the Cartesian product of graphs G1G_1 and G2G_2. In the paper achr(Kr2+r+1□Kq)\mathrm{achr}(K_{r^2+r+1}\square K_q) is determined for an infinite number of qqs provided that rr is a finite projective plane order.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.