Gray codes in graphs

Martin Knor

Mathematica Slovaca (1994)

  • Volume: 44, Issue: 4, page 395-412
  • ISSN: 0139-9918

How to cite

top

Knor, Martin. "Gray codes in graphs." Mathematica Slovaca 44.4 (1994): 395-412. <http://eudml.org/doc/31858>.

@article{Knor1994,
author = {Knor, Martin},
journal = {Mathematica Slovaca},
keywords = {permutations; Hamiltonian cycle; Hamiltonian paths; Gray codes; labellings},
language = {eng},
number = {4},
pages = {395-412},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {Gray codes in graphs},
url = {http://eudml.org/doc/31858},
volume = {44},
year = {1994},
}

TY - JOUR
AU - Knor, Martin
TI - Gray codes in graphs
JO - Mathematica Slovaca
PY - 1994
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 44
IS - 4
SP - 395
EP - 412
LA - eng
KW - permutations; Hamiltonian cycle; Hamiltonian paths; Gray codes; labellings
UR - http://eudml.org/doc/31858
ER -

References

top
  1. BIGGS N., Some odd graph theory, In: Second International Conference on Combinatorial Mathematics (New York, 1978). Ann. New York Acad. Sci. 319, New York Acad. Sci., New York, 1979, pp. 71-81. (1978) MR0556008
  2. BITNER J. R., EHRLICH G., REINGOLD E. M., Efficient generation of the binary reflected Gray code and its applications, Comm. ACM 19 (1976), 517-521. (1976) Zbl0333.94006MR0424386
  3. BUCK M., WIEDEMANN D., Gray codes with restricted density, Discrete Math. 48 (1984), 163-171. (1984) Zbl0572.05042MR0737262
  4. CHASE P. J., Algorithm 382 combinations of m out of n objects, Comm. ACM 13 (1970), 368, 376. (1970) 
  5. CHASE P. J., Transposition graphs, SIAM J. Comput. 2 (1973), 128-133. (1973) Zbl0264.05120MR0342438
  6. EHRLICH G., Loopless algorithms for generating permutations, combinations, and other combinatorial configurations, J. Assoc. Comput. Mach. 20 (1973), 500-513. (1973) Zbl0266.68018MR0366085
  7. GILBERT E. N., Gray codes and paths on the n-cube, Bell System Tech. J. 37 (1958), 815-826. (1958) MR0094273
  8. GRANT D. D., HOLTON D. A., Stable and semi-stable unicyclic graphs, Discrete Math. 9 (1974), 277-288. (1974) Zbl0286.05114MR0345876
  9. GRAY F., Pulse code communications, U. S. Patent 2632 058, March 17, 1953. (1953) 
  10. HU T. C, RUSKEY F., Generating binary trees lexicographically, SIAM J. Comput. 6 (1977), 745-758. (1977) Zbl0366.68027MR0478737
  11. JOHNSON S. M., Generation of permutations by adjacent transposition, Math. Comp. 17 (1963), 282-285. (1963) Zbl0114.01203MR0159764
  12. JOICHI S. T., WHITE D. E., Gray codes in graphs of subsets, Discrete Math. 31 (1980), 29-41. (1980) Zbl0449.05043MR0578058
  13. JOICHI S. T., WHITE D. E., WILLIAMSON S. G., Combinatorial Gray codes, SIAM J. Comput. 9 (1980), 130-141. (1980) Zbl0452.05009MR0557834
  14. MEREDITH G. H. J., LLOYD E. K., The Hamiltonian graphs O 4 to O 7 , Combinatorica (1972), 229-236. (1972) MR0457282
  15. PROSKUROWSKI A., RUSKEY F., Binary tree Gray codes, J. Algorithms 6 (1985), 225-238. (1985) Zbl0593.68050MR0789905
  16. PROSKUROWSKI A., RUSKEY F., Generating binary trees by transpositions, In: SWAT 88. Lecture Notes in Comput. Sci. 318, Springer, New York-Berlin, 1988, pp. 199-207. (1988) Zbl0651.68081MR1019370
  17. RUSKEY F., Adjacent interchange generation of combinations, J. Algorithms 9 (1988), 162-180. (1988) Zbl0726.05003MR0936104
  18. SAVAGE C. D., Gray code sequences of partitions, J. Algorithms 10 (1989), 557-595. (1989) Zbl0693.05006MR1022113
  19. TCHUENTE M., Generation of permutations by graphical exchanges, Ars Combin. 14 (1982), 115-122. (1982) Zbl0508.05041MR0683982

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.