S-packing chromatic vertex-critical graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F20%3A43959125" target="_blank" >RIV/49777513:23520/20:43959125 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/abs/pii/S0166218X20302092" target="_blank" >https://www.sciencedirect.com/science/article/abs/pii/S0166218X20302092</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.dam.2020.04.023" target="_blank" >10.1016/j.dam.2020.04.023</a>

Result language
angličtina
Original language name
S-packing chromatic vertex-critical graphs
Original language description
In this paper we introduce S-packing chromatic vertex-critical graphs, chi_S-critical for short,as the graphs G in which chi_S(G-u)<chi_S(G) for every vertex u of G. We show that a set of differences between chi_S(G) and chi_S(G-u) can be almost arbitrary. If G is chi_S-critical and chi-S(G)=k, then G is called k-chi_S-critical. We characterize 3-chi_S-critical graphs and partially characterize 4-chi_S-critical graphs when the first element in S is 1. We also deal with k-chi_S-criticality of catterpillars and trees.
Czech name
—
Czech description
—

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

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)

Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)