English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

If $S=(s_1,s_2,\ldots)$ is a non-decreasing sequence of positive integers,then the $S$-packing $k$-coloring of a graph $G$ is a mapping $c:V(G)\rightarrow[k]$ such that if $c(u)=c(v)=i$ for $u\neq v\in V(G)$, then$d_G(u,v)>s_i$. The $S$-packing chromatic number of $G$ is the smallest integer$k$ such that $G$ admits an $S$-packing $k$-coloring. A graph $G$ is$\chi_S$-vertex-critical if $\chi_S(G-u) < \chi_S(G)$ for each $u\in V(G)$. If$G$ is $\chi_S$-vertex-critical and $\chi_S(G) = k$, then $G$ is$k$-$\chi_S$-vertex-critical. In this paper, $4$-$\chi_S$-vertex-criticalgraphs are characterized for sequences $S = (1,s_2, s_3, \ldots)$ with $s_2 \ge3$. There are $28$ sporadic examples and two infinite families of such graphs.

A characterization of 4-$\chi_S$-vertex-critical graphs for packing sequences with $s_1 =1$ and $s_2\ge 3$