In the paper, we define a new parameter for tournaments called degreewid...
Let D be a k-regular bipartite tournament on n vertices. We show that,
f...
We prove a recent conjecture of Beisegel et al. that for every positive
...
Numerous problems consisting in identifying vertices in graphs using
dis...
Given a tournament T, the problem MaxCT consists of finding a maximum
(a...