Log In Sign Up

Asymptotically Optimal Vertex Ranking of Planar Graphs

by   Prosenjit Bose, et al.

A (vertex) ℓ-ranking is a labelling φ:V(G)→ℕ of the vertices of a graph G with integer colours so that for any path u_0,…,u_p of length at most ℓ, φ(u_0)≠φ(u_p) or φ(u_0)<max{φ(u_0),…,φ(u_p)}. We show that, for any fixed integer ℓ≥ 2, every n-vertex planar graph has an ℓ-ranking using O(log n/logloglog n) colours and this is tight even when ℓ=2; for infinitely many values of n, there are n-vertex planar graphs, for which any 2-ranking requires Ω(log n/logloglog n) colours. This result also extends to bounded genus graphs. In developing this proof we obtain optimal bounds on the number of colours needed for ℓ-ranking graphs of treewidth t and graphs of simple treewidth t. These upper bounds are constructive and give O(nlog n)-time algorithms. Additional results that come from our techniques include new sublogarithmic upper bounds on the number of colours needed for ℓ-rankings of apex minor-free graphs and k-planar graphs.


page 1

page 2

page 3

page 4


Adjacency Labelling for Planar Graphs (and Beyond)

We show that there exists an adjacency labelling scheme for planar graph...

Edge separators for graphs excluding a minor

We prove that every n-vertex K_t-minor-free graph G of maximum degree Δ ...

Local treewidth of random and noisy graphs with applications to stopping contagion in networks

We study the notion of local treewidth in sparse random graphs: the maxi...

Algorithmic upper bounds for graph geodetic number

Graph theoretical problems based on shortest paths are at the core of re...

Tuning Ranking in Co-occurrence Networks with General Biased Exchange-based Diffusion on Hyper-bag-graphs

Co-occurence networks can be adequately modeled by hyper-bag-graphs (hb-...

Bounds on half graph orders in powers of sparse graphs

Half graphs and their variants, such as ladders, semi-ladders and co-mat...