2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/59673We settle a question of Bressoud concerning the existence of an explicit bijection from a class of oriented square-ice graphs to a class of tournaments. We give an algorithm constructing such a bijection.18 pages, LaTeX; minor corrections. To appear in FoataFest proceedings issue of Advances in Applied MathematicsCombinatorics05A19 (Primary) 15A57 (Secondary)text