A lower bound for the packing chromatic number of the Cartesian product of cycles
Work
Year: 2013
Type: article
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 o... more
Source: Open Mathematics
Institution University of Johannesburg
Cites: 9
Cited by: 22
Related to: 10
FWCI: 2.265
Citation percentile (by year/subfield): 85.24
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $1,078