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

The online list coloring is a widely studied topic in graph theory. A graph$G$ is 2-paintable if we always have a strategy to complete a coloring in anonline list coloring of $G$ in which each vertex has a color list of size 2. Inthis paper, we focus on the online list coloring game in which the number ofcolors is known in advance. We say that $G$ is $[2,t]$-paintable if we alwayshave a strategy to complete a coloring in an online list coloring of $G$ inwhich we know that there are exactly $t$ colors in advance, and each vertex hasa color list of size 2.  Let $M(G)$ denote the maximum $t$ in which $G$ is not $[2,t]$-paintable, and$m(G)$ denote the minimum $t \geq 2$ in which $G$ is not $[2,t]$-paintable. Weshow that if $G$ is not 2-paintable, then $2 \leq m(G) \leq 4,$ and $n \leqM(G) \leq 2n-3.$ Furthermore, we characterize $G$ with $m(G)\in \{2,3,4\}$ and$M(G) \in \{n, n+1, 2n-3\},$ respectively.

Online List Colorings with the Fixed Number of Colors