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

A (k,t)-list assignment L of a graph G is a mapping which assigns a set of size k to each vertex v of G  and |⋃v∈V(G)‍L(v)|=t. A graph G is (k,t)-choosable if G has a proper coloring f such that f(v)∈L(v) for each (k,t)-list assignment L. In 2011, Charoenpanitseri et al. gave a characterization of (k,t)-choosability of n-vertex graphs when t≥kn-k2-2k+1 and left open problems when t≤kn-k2-2k. Recently, Ruksasakchai and Nakprasit obtain the results when t=kn-k2-2k. In this paper, we extend the results to case t=kn-k2-2k-1

international journal of mathematics and mathematical sciences

On<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1"><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mi>n</mml:mi><mml:mo>-</mml:mo><mml:msup><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>-</mml:mo><mml:mn>2</mml:mn><mml:mi>k</mml:mi><mml:mo>-</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math>-Choosability of<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML…

On(k,kn-k2-2k-1)-Choosability of