7 citations · 18 across the 18 of their papers we have counts for
6 papers · 1 filter
Upper bounds for linear graph codes
Leo Versteegen
A linear graph code is a family of graphs on vertices with the property that the symmetric difference of the edge sets of any two graphs in is also…
Strongly common graphs with odd girth are cycles
Leo Versteegen
A graph is called strongly common if for every coloring of with two colors, the number of monochromatic copies of is at least the number of monochromatic copies o…
On interval colourings of graphs
Lawrence Hollom, Julien Portier, Leo Versteegen
An interval colouring of a graph is a proper colouring such that the set of colours of edges incident to any given vertex forms an interval of $…
A note on interval colourings of graphs
Maria Axenovich, António Girão, Lawrence Hollom +5
A graph is said to be interval colourable if it admits a proper edge-colouring using palette in which the set of colours incident to each vertex is an interval. The in…
The structure of large sum-free sets in
Leo Versteegen
A set is sum-free if does not intersect . If , the maximal size of a sum-free in is known to be $(p^n+p^{n-1})…
Progress towards the 1/2-Conjecture for the domination game
Julien Portier, Leo Versteegen
The domination game is played on a graph by two players, Dominator and Staller, who alternate in selecting vertices until each vertex in the graph is contained in the close…