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

Assume $L$ is a $k$-list assignment of a graph $G$. A $d$-defective $m$-fold$L$-colouring $\phi$ of $G$ assigns to each vertex $v$ a set $\phi(v)$ of $m$colours, so that $\phi(v) \subseteq L(v)$ for each vertex $v$, and for eachcolour $i$, the set $\{v: i \in \phi(v)\}$ induces a subgraph of maximum degreeat most $d$. In this paper, we consider on-line list $d$-defective $m$-foldcolouring of graphs, where the list assignment $L$ is given on-line, and thecolouring is constructed on-line. To be precise, the $d$-defective$(k,m)$-painting game on a graph $G$ is played by two players: Lister andPainter. Initially, each vertex has $k$ tokens and is uncoloured. In eachround, Lister chooses a set $M$ of vertices and removes one token from eachchosen vertex. Painter colours a subset $X$ of $M$ which induces a subgraph$G[X]$ of maximum degree at most $d$. A vertex $v$ is fully coloured if $v$ hasreceived $m$ colours. Lister wins if at the end of some round, there is avertex with no more tokens left and is not fully coloured. Otherwise, at someround, all vertices are fully coloured and Painter wins. We say $G$ is$d$-defective $(k,m)$-paintable if Painter has a winning strategy in this game.This paper proves that every planar graph is $1$-defective $(9,2)$-paintable.

Every planar graph is $1$-defective $(9,2)$-paintable