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

Abstract  The r‐dynamic choosability  of a graph  G , writtench   r    (  G  )    , is the least  k  such that whenever each vertex is assigned a list of at least  k  colors a proper coloring can be chosen from the lists so that every vertex  v  has at least    min  {   d  G    (  v  )   ,  r  }    neighbors of distinct colors. Let ch( G ) denote the choice number of  G . In this article, we provech   r    (  G  )   ≤   (  1  +  o   (  1  )   )    ch    (  G  )whenΔ  (  G  )    δ  (  G  )is bounded. We also show that there exists a constant  C  such that the random graph    G  =  G  (  n  ,  p  )    with6  log  (  n  )   n   <  p  ≤   1  2almost surely satisfiesch   2    (  G  )   ≤   ch    (  G  )   +  C   . Also if  G  is a triangle‐free regular graph, then we havech   2    (  G  )   ≤   ch    (  G  )   +  86   .

Dynamic choosability of triangle‐free graphs and sparse random graphs