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: 299; Downloads: 2 Full text (379,74 KB)
Keywords: isomorphism, DCI-groups, Schur ringsPublished in RUP: 24.11.2021; Views: 2736; Downloads: 28 Link to full text
Keywords: isomorphism, CI-group, Schur ringPublished in RUP: 17.12.2018; Views: 3689; Downloads: 128 Link to full text