Abstract
A vertex colouring of a graph is complete if for any with there are in adjacent vertices such that and . The achromatic number of is the maximum number of colours in a proper complete vertex colouring of . Let denote the Cartesian product of graphs and . In the paper is determined for an infinite number of s provided that is a finite projective plane order.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.