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

For a nondecreasing sequence of integers $S=(s_1, s_2, \ldots)$ an$S$-packing $k$-coloring of a graph $G$ is a mapping from $V(G)$ to $\{1,2,\ldots,k\}$ such that vertices with color $i$ have pairwise distance greaterthan $s_i$. By setting $s_i = d + \lfloor \frac{i-1}{n} \rfloor$ we obtain a$(d,n)$-packing coloring of a graph $G$. The smallest integer $k$ for whichthere exists a $(d,n)$-packing coloring of $G$ is called the $(d,n)$-packingchromatic number of $G$. In the special case when $d$ and $n$ are both equal toone we speak of the packing chromatic number of $G$. We determine the packingchromatic number of the base-3 Sierpi\'{n}ski graphs $S_k$ and provide newresults on $(d,n)$-packing chromatic colorings, $d \le 2$, for this class ofgraphs. By using a dynamic algorithm, we establish the packing chromatic numberfor $H$-graphs $H(r)$.

On the packing coloring of base-3 Sierpi\'{n}ski and $H$ graphs