Hadwiger's Conjecture asserts that every K_h-minor-free graph is properl...
An infinite graph is quasi-transitive if its vertex set has finitely man...
For any hereditary graph class ℱ, we construct optimal adjacency
labelin...
A graph is O_k-free if it does not contain k pairwise vertex-disjoint an...
We study the problems of adjacency sketching, small-distance sketching, ...
The main problem in the area of property testing is to understand which ...
Coloring unit-disk graphs efficiently is an important problem in the glo...
A proof labelling scheme for a graph class 𝒞 is an assignment of
certifi...
The asymptotic dimension is an invariant of metric spaces introduced by
...
We construct asymptotically optimal adjacency labelling schemes for ever...
In this paper we study fractional coloring from the angle of distributed...
We show that for every integer n≥ 1 there exists a graph G_n with
(1+o(1...
We show that there exists an adjacency labelling scheme for planar graph...
We prove that for every integer t> 1 there exists a constant c_t such
th...
A colouring of a graph is "nonrepetitive" if for every path of even orde...
This paper is devoted to the distributed complexity of finding an
approx...
This paper studies sufficient conditions to obtain efficient distributed...
Given a multigraph, suppose that each vertex is given a local assignment...
This paper is concerned with efficiently coloring sparse graphs in the
d...
We study a restricted form of list colouring, for which every pair of li...