Log In Sign Up

Adjacency Labelling for Planar Graphs (and Beyond)

by   Vida Dujmovic, et al.

We show that there exists an adjacency labelling scheme for planar graphs where each vertex of an n-vertex planar graph G is assigned a (1+o(1))log_2 n-bit label and the labels of two vertices u and v are sufficient to determine if uv is an edge of G. This is optimal up to the lower order term and is the first such asymptotically optimal result. An alternative, but equivalent, interpretation of this result is that, for every n, there exists a graph U_n with n^1+o(1) vertices such that every n-vertex planar graph is an induced subgraph of U_n. These results generalize to bounded genus graphs, apex-minor-free graphs, bounded-degree graphs from minor closed families, and k-planar graphs.


page 1

page 2

page 3

page 4


Asymptotically Optimal Vertex Ranking of Planar Graphs

A (vertex) ℓ-ranking is a labelling φ:V(G)→ℕ of the vertices of a graph ...

Optimal labelling schemes for adjacency, comparability and reachability

We construct asymptotically optimal adjacency labelling schemes for ever...

Parallel Planar Subgraph Isomorphism and Vertex Connectivity

We present the first parallel fixed-parameter algorithm for subgraph iso...

Local certification of graphs on surfaces

A proof labelling scheme for a graph class 𝒞 is an assignment of certifi...

Multi-layered planar firefighting

Consider a model of fire spreading through a graph; initially some verti...

Adjacency Graphs of Polyhedral Surfaces

We study whether a given graph can be realized as an adjacency graph of ...

Graphs without gap-vertex-labellings: families and bounds

A proper labelling of a graph G is a pair (π,c_π) in which π is an assig...