4 papers
Set-defined graph classes: -boundedness meets tropical algebra
Sarosh Adenwalla, Samuel Braunfeld, Tomáš Hons +2
We study set-defined graph classes: hereditary classes whose vertices are assigned fixed-length numerical tuples, with adjacency determined solely by equality patterns among coordi…
Temporal Exploration of Random Spanning Tree Models
Samuel Baguley, Andreas Göbel, Nicolas Klodt +3
The Temporal Graph Exploration problem (TEXP) takes as input a temporal graph, i.e., a sequence of graphs on the same vertex set, and asks for a walk of s…
Functionality of Random Graphs
John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
The functionality of a graph is the minimum number such that in every induced subgraph of there exists a vertex whose neighbourhood is uniquely determined by the neighb…
Boolean combinations of graphs
Sarosh Adenwalla, Samuel Braunfeld, John Sylvester +1
Boolean combinations allow combining given combinatorial objects to obtain new, potentially more complicated, objects. In this paper, we initiate a systematic study of this idea ap…