2 citations · 3 across the 3 of their papers we have counts for
1 paper · 1 filter
Matthew DeVilbiss, Bradley Fain, Amber Holmes +3
A spanning tree of an edge-colored graph is rainbow provided that each of its edges receives a distinct color. In this paper we consider the natural extremal problem of maximizing…