S-packing colorings of distance graphs G(Z,{2,t})
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F21%3A43970935" target="_blank" >RIV/49777513:23520/21:43970935 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S0166218X2100144X?via%3Dihub" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0166218X2100144X?via%3Dihub</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.dam.2021.04.001" target="_blank" >10.1016/j.dam.2021.04.001</a>
Alternative languages
Result language
angličtina
Original language name
S-packing colorings of distance graphs G(Z,{2,t})
Original language description
The smallest k such that G has an S-packing k-coloring is the S-packing chromatic number of G. The S-packing chromatic numbers of the graphs G(Z,{2,t}), where S is any sequence with a(i) is an element of {1, 2} for all i, are determined.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/GA20-09525S" target="_blank" >GA20-09525S: Structural properties of graph classes characterized by forbidden subgraphs</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
DISCRETE APPLIED MATHEMATICS
ISSN
0166-218X
e-ISSN
1872-6771
Volume of the periodical
298
Issue of the periodical within the volume
červenec
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
12
Pages from-to
143-154
UT code for WoS article
000674747900008
EID of the result in the Scopus database
2-s2.0-85104462419