Abstract
The square of a graph is defined on the vertex set of in such a way that distinct vertices with distance at most two in are joined by an edge. We study the chromatic number of the square of the Cartesian product of two cycles and show that the value of this parameter is at most 7 except when , in which case the value is 9, and when or and , in which case the value is 8. Moreover, we conjecture that whenever , the chromatic number of equals , where denotes the size of a maximal independent set in .
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.