An arc-colored tournament is said to be $k$-spanning for an integer $k\geq 1$ if the union of its arc-color classes of maximal valency at most $k$ is the arc set of a strongly connected digraph. It is proved that isomorphism testing of $k$-spanning tournaments is fixed-parameter tractable.

翻译：对于一个整数 $k \geq 1$，若其最大权值至多为 $k$ 的弧彩色类之并构成强连通有向图的弧集，则该弧色锦标赛称为 $k$-可扩的。本文证明了 $k$-可扩锦标赛的同构测试是固定参数可解的。