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/

Zendy Plus

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

Zendy Tools

Zendy Open

An edge colouring of a graph  G  is called acyclic if it is proper and every cycle contains at least three colours. We show that for every    ε  >  0   , there exists a    g  =  g  (  ε  )    such that if  G  has maximum degree Δ and girth at least  g  then  G  admits an acyclic edge colouring with    (  1  +  ε  )  Δ  +  O  (  1  )    colours. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 511–533, 2017

Acyclic edge colourings of graphs with large girth