Adjacency Labelling for Planar Graphs (and Beyond) - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of the ACM (JACM) Année : 2021

Adjacency Labelling for Planar Graphs (and Beyond)

Louis Esperet
Vida Dujmović
  • Fonction : Auteur
Gwenaël Joret
  • Fonction : Auteur
Piotr Micek
  • Fonction : Auteur
Pat Morin
  • Fonction : Auteur

Résumé

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 positive integer 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 a number of other graph classes, including bounded genus graphs, apex-minor-free graphs, bounded-degree graphs from minor closed families, and k -planar graphs.

Dates et versions

hal-03374608 , version 1 (12-10-2021)

Identifiants

Citer

Louis Esperet, Vida Dujmović, Cyril Gavoille, Gwenaël Joret, Piotr Micek, et al.. Adjacency Labelling for Planar Graphs (and Beyond). Journal of the ACM (JACM), 2021, 68 (6), pp.1-33. ⟨10.1145/3477542⟩. ⟨hal-03374608⟩
66 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More