An arc-colored tournament is said to be k-spanning for an integer k≥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.
@article{arxiv.2201.12312,
title = {Isomorphism testing of $k$-spanning tournaments is Fixed Parameter Tractable},
author = {Vikraman Arvind and Ilia Ponomarenko and Grigory Ryabov},
journal= {arXiv preprint arXiv:2201.12312},
year = {2023}
}