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

Holub, P; Hofman, J

Holub, P (通讯作者),Univ West Bohemia Pilsen, Fac Appl Sci, Plzen, Czech Republic.

APPLIED MATHEMATICS AND COMPUTATION, 2023; 447 ():

Abstract

For a non-decreasing sequence of positive integers S = (s 1 , s 2 , ...), the S-packing chromatic number xS(G) of a graph G is the smallest integer k ......

Full Text Link