Jan Bok

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2025

On the expressive power of $2$ -edge-colourings of graphs

Jan Bok, Santiago GuzmÃ¡n-Pro, Nikola JedliÄkovÃ¡ +1

Given a finite set of $2$ -edge-coloured graphs $F$ and a hereditary property of graphs $P$ , we say that $F$ expresses $P$ if a graph $G$ has t…

math.CO2024

Resolving Sets in Temporal Graphs

Jan Bok, Antoine Dailly, Tuomo LehtilÃ¤

A \emph{resolving set} $R$ in a graph $G$ is a set of vertices such that every vertex of $G$ is uniquely identified by its distances to the vertices of $R$ . Introduced in the 1970s…

On the expressive power of 2-edge-colourings of graphs

Resolving Sets in Temporal Graphs

On the expressive power of $2$ -edge-colourings of graphs