DeepAI AI Chat
Log In Sign Up

Bounding generalized coloring numbers of planar graphs using coin models

01/23/2022
by   Jesper Nederlof, et al.
0

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∈ℕ, 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řák and Siebertz.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/19/2022

Odd coloring of two subclasses of planar graphs

A proper coloring of a graph is odd if every non-isolated vertex has som...
03/31/2021

Weak Coloring Numbers of Intersection Graphs

Weak and strong coloring numbers are generalizations of the degeneracy o...
07/28/2019

Uniform Orderings for Generalized Coloring Numbers

The generalized coloring numbers scol_r(G) and wcol_r(G) of a graph G we...
03/31/2018

Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model

In this paper, we consider distributed coloring for planar graphs with a...
03/07/2022

Turbocharging Heuristics for Weak Coloring Numbers

Bounded expansion and nowhere-dense classes of graphs capture the theore...
05/28/2018

On the intersection graph of the disks with diameters the sides of a convex n-gon

Given a convex n-gon, we can draw n disks (called side disks) where each...
05/25/2023

An exponential bound for simultaneous embeddings of planar graphs

We show that there are O(n · 4^n/11) planar graphs on n vertices which d...