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

We study choosability with separation which is a constrained version of list coloring of graphs. A    (  k  ,  d  )   ‐ list assignment L  of a graph  G  is a function that assigns to each vertex  v  a list    L  (  v  )    of at least  k  colors and for any adjacent pair    x  y   , the lists    L  (  x  )    and    L  (  y  )    share at most  d  colors. A graph  G  is    (  k  ,  d  )   ‐choosable if there exists an  L ‐coloring of  G  for every    (  k  ,  d  )   ‐list assignment  L . This concept is also known as choosability with separation. We prove that planar graphs without 4‐cycles are (3, 1)‐choosable and that planar graphs without 5‐ and 6‐cycles are (3, 1)‐choosable. In addition, we give an alternative and slightly stronger proof that triangle‐free planar graphs are (3, 1)‐choosable.

On Choosability with Separation of Planar Graphs with Forbidden Cycles