An adjacency labeling scheme for a given class of graphs is an algorithm that for every
graph G from the class, assigns bit strings (labels) to vertices of G so that for any two vertices …

Stanislaw Ulam asked whether there exists a universal countable planar graph (that is, a
countable planar graph that contains every countable planar graph as a subgraph). J\'anos …

For an arbitrary finite family of graphs, the distance labeling problem asks to assign labels to
all nodes of every graph in the family in a way that allows one to recover the distance …

A combinatorial structure is said to be m-universal if it contains all other structures of the
same kind of size m. Rado first introduced the notion of universality for infinite graphs in …

In standard graph representations, such as with adjacency lists and matrices, vertex
identifiers do not play any particular role with respect to the structure of the graph: they are …