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

For a graph , let (,) be its chromatic polynomial. Two graphs  and  are chromatically equivalent, denoted ∼, if (,)=(,). A graph  is chromatically unique if (,)=(,) implies that ≅. In this paper, we determine all chromatic equivalence classes of 2-connected (,

isrn discrete mathematics

Chromatic Classes of 2-Connected <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:math>-Graphs with Exactly Three Triangles and at Least Two Induced 4-Cycles

Chromatic Classes of 2-Connected (n,n+4)-Graphs with Exactly Three Triangles and at Least Two Induced 4-Cycles