27 citations · 100 across the 27 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.CO2021
Tangled Paths: A Random Graph Model from Mallows Permutations
Jessica Enright, Kitty Meeks, William Pettersson +1
We introduce the random graph which results from taking the union of two paths of length , where the vertices of one of the paths have been relabelled a…
cs.CC2021
Edge exploration of temporal graphs
Benjamin Merlin Bumpus, Kitty Meeks
We introduce a natural temporal analogue of Eulerian circuits and prove that, in contrast with the static case, it is NP-hard to determine whether a given temporal graph is tempora…
math.CO2021
Reconstructing the degree sequence of a sparse graph from a partial deck
Carla Groenland, Tom Johnston, Andrey Kupavskii +3
The deck of a graph is the multiset of cards . Myrvold (1992) showed that the degree sequence of a graph on vertices can be reconstructed from any d…