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

We provide upper bounds on the $L(p,q)$-labeling number of graphs which haveinterval (or circular-arc) representations via simple greedy algorithms. Weprove that there exists an $L(p,q)$-labeling with span at most$\max\{2(p+q-1)\Delta-4q+2, (2p-1)\mu+(2q-1)\Delta-2q+1\}$ for interval$k$-graphs, $\max\{p,q\}\Delta$ for interval graphs, $3\max\{p,q\}\Delta+p$ forcircular-arc graphs, $2(p+q-1)\Delta-2q+1$ for permutation graphs and$(2p-1)\Delta+(2q-1)(\mu-1)$ for cointerval graphs. In particular, theseimprove existing bounds on $L(p,q)$-labeling of interval graphs and$L(2,1)$-labeling of permutation graphs. Furthermore, we provide upper boundson the coloring of the squares of aforementioned classes.

$L(p,q)$-Labeling of Graphs with Interval Representations