A note on an embedding problem in transitive tournaments
Discrete Mathematics2009Vol. 310(4), pp. 681–686
Citations Over Time
Related Papers
- → Making a tournament k-arc-strong by reversing or deorienting arcs(2003)7 cited
- An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a fuzzy proximity(2009)
- → Unavoidable tournaments(2015)4 cited
- → On $k$-transitive closures of directed paths(2014)
- On $k$-transitive closures of directed paths(2014)