2014
DOI: 10.1016/j.dam.2013.09.016
|View full text |Cite
|
Sign up to set email alerts
|

A note onS-packing colorings of lattices

Abstract: a b s t r a c tLet a 1 , a 2 , . . . , a k be positive integers. An (a 1 , a 2 , . . . , a k )-packing coloring of a graph G is a mapping from V (G) to {1, 2, . . . , k} such that vertices with color i have pairwise distance greater than a i . In this paper, we study (a 1 , a 2 , . . . , a k )-packing colorings of several lattices including the infinite square, triangular, and hexagonal lattices. For k small, we determine all a i such that these graphs have packing colorings. We also give some exact values and… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
13
0

Year Published

2015
2015
2025
2025

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 28 publications
(13 citation statements)
references
References 12 publications
0
13
0
Order By: Relevance
“…The vertex analogous of S-packing edge-coloring has been first studied by Goddard and Xu [16,17] and then recently on cubic graphs [2,3,4,12,14]. The particular case of (1, 2, .…”
Section: Introductionmentioning
confidence: 99%
“…The vertex analogous of S-packing edge-coloring has been first studied by Goddard and Xu [16,17] and then recently on cubic graphs [2,3,4,12,14]. The particular case of (1, 2, .…”
Section: Introductionmentioning
confidence: 99%
“…If 1 a / ∈ f 2 (N (w 4 ) − w 1 ), then we obtain a feasible coloring on G by switching colors of w 1 and w 4 , assigning 1 a to w, and using f 2 on other vertices. Therefore, by (18), we may assume f 2 (N (w 4 ) − w 1 ) = {1 a , 1 b }. Similarly, by (18), we may assume f 2 (N (w 6 ) − w 2 ) = {1 a , 1 b } (See Figure 3).…”
Section: Proof Of Theoremmentioning
confidence: 99%
“…Therefore, by (18), we may assume f 2 (N (w 4 ) − w 1 ) = {1 a , 1 b }. Similarly, by (18), we may assume f 2 (N (w 6 ) − w 2 ) = {1 a , 1 b } (See Figure 3). With (14), (17), and the case, 3 a / ∈ f 2 (B(w, 3) − {w}) and we can extend f 2 to G by assigning f 2 (w) = 3 a .…”
Section: Proof Of Theoremmentioning
confidence: 99%
“…, k) first appear in [7,3]. Goddard and Xu [8] have recently studied S-packing colorings for the infinite path and for square and triangular lattices, determining conditions on the first elements of the sequence for which the graph is or is not S-packingcolorable.…”
Section: Motivation and Related Workmentioning
confidence: 99%
“…However, determining the families of graphs G for which for any S such that G is S-colorable, the S-coloring satisfies the above property is satisfied remains an open question. Recently Goddard and Xu [8] proved that there exist nondecreasing sequences S such that P ∞ is S-colorable and in any (s 1 , . .…”
Section: Motivation and Related Workmentioning
confidence: 99%