4 citations · 16 across the 19 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013★ 3 cited
On the edge-reconstruction number of a tree
Kevin Asciak, Josef Lauri, Wendy Myrvold +1
The edge-reconstruction number ern of a graph is equal to the minimum number of edge-deleted subgraphs of which are sufficient to determine up to isomorphsim…
math.CO2013
Non-monochromatic non-rainbow colourings of -hypergraphs
Yair Caro, Josef Lauri
One of the most interesting new developments in hypergraph colourings in these last few years has been Voloshin's notion of colourings of mixed hypergraphs. In this paper we shall…