Author:
Mütze Torsten,Standke Christoph,Wiechert Veit
Subject
Discrete Mathematics and Combinatorics
Reference58 articles.
1. Some odd graph theory;Biggs,1979
2. Efficient generation of the binary reflected Gray code and its applications;Bitner;Comm. ACM.,1976
3. Gray codes with restricted density;Buck;Discrete Math.,1984
4. An Eades-McKay algorithm for well-formed parentheses strings;Bultena;Inform. Process. Lett.,1998
5. Combination generation and graylex ordering;Chase;Congr. Numer.,1989
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Tight Dyck Words, Castling and Odd Graphs;2023
2. Sparse Kneser graphs are Hamiltonian;Journal of the London Mathematical Society;2020-12-10
3. A Constant-Time Algorithm for Middle Levels Gray Codes;Algorithmica;2019-10-25
4. Sparse Kneser graphs are Hamiltonian;Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing;2018-06-20
5. A short proof of the middle levels theorem;Discrete Analysis;2018-05-21