Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups
Authors:
- 1 August 2003
- journal article
- Published by Elsevier in Journal of Algebra
- Vol. 266 (1) , 220-238
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- ALGORITHMS FOR LABELING CONSTANT WEIGHT GRAY CODESGlasgow Mathematical Journal, 2005
- Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroupsJournal of Algebra, 2003
- COMBINATORIAL TECHNIQUES FOR DETERMINING RANK AND IDEMPOTENT RANK OF CERTAIN FINITE SEMIGROUPSProceedings of the Edinburgh Mathematical Society, 2002
- A Survey of Combinatorial Gray CodesSIAM Review, 1997
- Monotone Gray codes and the middle levels problemJournal of Combinatorial Theory, Series A, 1995
- Idempotent rank in finite full transformation semigroupsProceedings of the Royal Society of Edinburgh: Section A Mathematics, 1990
- Two hamilton cycles in bipartite reflective kneser graphsDiscrete Mathematics, 1988
- Efficient generation of the binary reflected gray code and its applicationsCommunications of the ACM, 1976
- Algorithm 382: combinations of M out of N objects [G6]Communications of the ACM, 1970