3 citations · 8 across the 12 of their papers we have counts for
1 paper · 1 filter
Juan José Montellano-Ballesteros, Eduardo Rivera Campo
Given a tournament T, let h(T) be the smallest integer k such that every arc-coloring of T with k or more colors produces at least one out-directed spanning tree of T with no pair…