Weak Coloring Numbers of Intersection Graphs

03/31/2021
by   Zdeněk Dvořák, et al.
0

Weak and strong coloring numbers are generalizations of the degeneracy of a graph, where for each natural number k, we seek a vertex ordering such every vertex can (weakly respectively strongly) reach in k steps only few vertices with lower index in the ordering. Both notions capture the sparsity of a graph or a graph class, and have interesting applications in the structural and algorithmic graph theory. Recently, the first author together with McCarty and Norin observed a natural volume-based upper bound for the strong coloring numbers of intersection graphs of well-behaved objects in ℝ^d, such as homothets of a centrally symmetric compact convex object, or comparable axis-aligned boxes. In this paper, we prove upper and lower bounds for the k-th weak coloring numbers of these classes of intersection graphs. As a consequence, we describe a natural graph class whose strong coloring numbers are polynomial in k, but the weak coloring numbers are exponential. We also observe a surprising difference in terms of the dependence of the weak coloring numbers on the dimension between touching graphs of balls (single-exponential) and hypercubes (double-exponential).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/07/2022

Turbocharging Heuristics for Weak Coloring Numbers

Bounded expansion and nowhere-dense classes of graphs capture the theore...
research
01/23/2022

Bounding generalized coloring numbers of planar graphs using coin models

We study Koebe orderings of planar graphs: vertex orderings obtained by ...
research
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...
research
06/07/2021

Improving Lower Bounds for Equitable Chromatic Number

In many practical applications the underlying graph must be as equitable...
research
08/17/2020

Graph colorings under global structural conditions

More than ten years ago in 2008, a new kind of graph coloring appeared i...
research
03/18/2020

Colorings of complements of line graphs

Our purpose is to show that complements of line graphs enjoy nice colori...
research
12/20/2021

Hardness of the Generalized Coloring Numbers

The generalized coloring numbers of Kierstead and Yang offer an algorith...

Please sign up or login with your details

Forgot password? Click here to reset