Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups

DOI10.1016/S0021-8693(03)00276-XzbMath1029.05007MaRDI QIDQ1403878

Inessa Levi, Steve Seif

Publication date: 20 August 2003

Published in: Journal of Algebra (Search for Journal in Brave)

zbMATH Keywords

partitionHamiltonian cyclemiddle levels conjecturelabeled pathorthogonally labeled

Mathematics Subject Classification ID

Partitions of sets (05A18) Semigroups of transformations, relations, partitions, etc. (20M20) Other types of codes (94B60) Eulerian and Hamiltonian graphs (05C45)

Related Items

Diagram monoids and Graham-Houghton graphs: idempotents and generating sets of ideals, Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups, The minimal number of generators of a finite semigroup., On Rank Properties of Endomorphisms of Finite Circular Orders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two Hamilton cycles in bipartite reflective Kneser graphs
• Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups
• Monotone Gray codes and the middle levels problem
• Permutational labelling of constant weight Gray codes
• Index system and separability of constant weight Gray codes
• Idempotent rank in finite full transformation semigroups
• Efficient generation of the binary reflected gray code and its applications
• S_n-normal semigroups
• A Survey of Combinatorial Gray Codes
• COMBINATORIAL TECHNIQUES FOR DETERMINING RANK AND IDEMPOTENT RANK OF CERTAIN FINITE SEMIGROUPS
• ALGORITHMS FOR LABELING CONSTANT WEIGHT GRAY CODES