5 papers
Isometric universal graphs
Louis Esperet, Cyril Gavoille, Carla Groenland
A subgraph of a graph is isometric if the distances between vertices in coincide with the distances between the corresponding vertices in . We show that for any inte…
A note on connected greedy edge colouring
Marthe Bonamy, Carla Groenland, Carole Muller +3
Following a given ordering of the edges of a graph , the greedy edge colouring procedure assigns to each edge the smallest available colour. The minimum number of colours thus i…
Optimal labelling schemes for adjacency, comparability, and reachability
Marthe Bonamy, Louis Esperet, Carla Groenland +1
We construct asymptotically optimal adjacency labelling schemes for every hereditary class containing -vertex graphs as . This regime contains many cla…
Surfaces have (asymptotic) dimension 2
Marthe Bonamy, Nicolas Bousquet, Louis Esperet +3
The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. When restricted to graphs and their shortest paths metric,…
Stimulated Raman adiabatic passage-like protocols for amplitude transfer generalize to many bipartite graphs
Koen Groenland, Carla Groenland, Reinier Kramer
Adiabatic passage techniques, used to drive a system from one quantum state into another, find widespread application in physics and chemistry. We focus on techniques to spatially…