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 study Koebe orderings of planar graphs: vertex orderings obtained bymodelling the graph as the intersection graph of pairwise internally-disjointdiscs in the plane, and ordering the vertices by non-increasing radii of theassociated discs. We prove that for every $d\in \mathbb{N}$, any such orderinghas $d$-admissibility bounded by $O(d/\ln d)$ and weak $d$-coloring numberbounded by $O(d^4 \ln d)$. This in particular shows that the $d$-admissibilityof planar graphs is bounded by $O(d/\ln d)$, which asymptotically matches aknown lower bound due to Dvo\v{r}\'ak and Siebertz.

Bounding generalized coloring numbers of planar graphs using coin models