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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

For $1\leq s_1 \le s_2 \le \ldots \le s_k$ and a graph $G$, a packing $(s_1,s_2, \ldots, s_k)$-coloring of $G$ is a partition of $V(G)$ into sets $V_1,V_2, \ldots, V_k$ such that, for each $1\leq i \leq k$, the distance betweenany two distinct $x,y\in V_i$ is at least $s_i + 1$. The packing chromaticnumber, $\chi_p(G)$, of a graph $G$ is the smallest $k$ such that $G$ has apacking $(1,2, \ldots, k)$-coloring. It is known that there are trees ofmaximum degree 4 and subcubic graphs $G$ with arbitrarily large $\chi_p(G)$.Recently, there was a series of papers on packing $(s_1, s_2, \ldots,s_k)$-colorings of subcubic graphs in various classes. We show that every$2$-connected subcubic outerplanar graph has a packing $(1,1,2)$-coloring andevery subcubic outerplanar graph is packing $(1,1,2,4)$-colorable. Our resultsare sharp in the sense that there are $2$-connected subcubic outerplanar graphsthat are not packing $(1,1,3)$-colorable and there are subcubic outerplanargraphs that are not packing $(1,1,2,5)$-colorable. We also show subcubicouterplanar graphs that are not packing $(1,2,2,4)$-colorable and not packing$(1,1,3,4)$-colorable.

Packing $(1,1,2,4)$-coloring of subcubic outerplanar graphs