{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:42:58Z","timestamp":1753893778860,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We study Koebe orderings of planar graphs: vertex orderings obtained by modelling the graph as the intersection graph of pairwise internally-disjoint discs in the plane, and ordering the vertices by non-increasing radii of the associated discs. We prove that for every $d\\in \\mathbb{N}$, any such ordering has $d$-admissibility bounded by $O(d\/\\ln d)$ and weak $d$-coloring number bounded by $O(d^4 \\ln d)$. This in particular shows that the $d$-admissibility of planar graphs is bounded by $O(d\/\\ln d)$, which asymptotically matches a known lower bound due to Dvo\u0159\u00e1k and Siebertz.<\/jats:p>","DOI":"10.37236\/11095","type":"journal-article","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T18:04:48Z","timestamp":1695319488000},"source":"Crossref","is-referenced-by-count":0,"title":["Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models"],"prefix":"10.37236","volume":"30","author":[{"given":"Jesper","family":"Nederlof","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karol","family":"W\u0119grzycki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2023,9,22]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v30i3p33\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v30i3p33\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T18:04:48Z","timestamp":1695319488000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v30i3p33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,22]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,7,14]]}},"URL":"https:\/\/doi.org\/10.37236\/11095","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2023,9,22]]},"article-number":"P3.33"}}