On lexicographic semi-commutations
We give a characterization of the communication graphs for which there exists a complete semi-commutation system. From this, we deduce a characterization of semi-commutation systems for which the set of minimal words and the set of irreducible words are equal.
scientific article; zbMATH DE number 4068325
scientific article