101 citations · 240 across the 32 of their papers we have counts for
4 papers · 1 filter
Near-domination in graphs
Bruce Reed, Alex Scott, Paul Seymour
A vertex u of a graph t-dominates a vertex v if there are at most t vertices different from u,v that are adjacent to v and not to u; and a graph is t-dominating if for every pair o…
Building your path to escape from home
Daniel R. Figueiredo, Giulio Iacobelli, Roberto I. Oliveira +2
Random walks on dynamic graphs have received increasingly more attention from different academic communities over the last decade. Despite the relatively large literature, little i…
Notes on Growing a Tree in a Graph
Luc Devroye, Vida Dujmović, Alan Frieze +3
We study the height of a spanning tree of a graph obtained by starting with a single vertex of and repeatedly selecting, uniformly at random, an edge of with exactl…
Colourings with Bounded Monochromatic Components in Graphs of Given Circumference
Bojan Mohar, Bruce Reed, David R. Wood
We prove that every graph with circumference at most is -colourable such that every monochromatic component has size at most . The bound on the num…