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

An edge coloring of a graph $G$ with colors $1,2,..., t$ is called aninterval $t$-coloring if for each $i\in \{1,2,...,t\}$ there is at least oneedge of $G$ colored by $i$, the colors of edges incident to any vertex of $G$are distinct and form an interval of integers. In 1994 Asratian and Kamalianproved that if a connected graph $G$ admits an interval $t$-coloring, then$t\leq (d+1) (\Delta -1) +1$, and if $G$ is also bipartite, then this upperbound can be improved to $t\leq d(\Delta -1) +1$, where $\Delta$ is the maximumdegree in $G$ and $d$ is the diameter of $G$. In this paper we show that theseupper bounds can not be significantly improved.

A note on upper bounds for the maximum span in interval edge colorings of graphs