On S-packing colourings of distance graphs D(1,t) and D(1,2,t)

Přemysl Holub and Jakub Hofman

Applied Mathematics and Computation, 2023, vol. 447, issue C

Abstract: For a non-decreasing sequence of positive integers S=(s1,s2,…), the S-packing chromatic numberχS(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into subsets Xi, i∈{1,2,…,k}, where vertices in Xi are pairwise at distance greater than Si. By an infinite distance graph with distance set D we mean a graph with vertex set Z in which two vertices i,j are adjacent whenever |i−j|∈D. In this paper we investigate the S-packing chromatic number of infinite distance graphs with distance set D={1,t}, t≥2, and D={1,2,t}, t≥3, for sequences S having all elements from {1,2}.

Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323000243
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:447:y:2023:i:c:s0096300323000243

DOI: 10.1016/j.amc.2023.127855

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().