Abstract: 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.Keywords: graph isomorphism problem, colored tournaments, fixed-parameter tractable algorithmPublished in RUP: 03.11.2025; Views: 297; Downloads: 2 Full text (379,74 KB)
