Prefer a chat interface with context about you and your work?
A lower bound for the packing chromatic number of the Cartesian product of cycles
Abstract Let G = (V, E) be a simple graph of order n and i be an integer with i ≥ 1. The set X i ⊆ V(G) is called an i-packing if each two distinct vertices in X i are more than i apart. A packing colouring of G …