Author:
King Adam,Laubmeier Amanda,Orans Kai,Godbole Anant
Funder
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. Aardenne-Ehrenfest, T.V., de Bruijn, N.G.: Circuits and trees in oriented linear graphs. Bull. Belg. Math. Soc.: Simon Stevin 28, 203–217 (1951)
2. Blanca, A., Godbole, A.: On universal cycles for new classes of combinatorial structures. SIAM J. Discrete Math. 25, 1832–1842 (2011)
3. Brightwell, G., Winkler, P.: Counting linear extensions. Order 8, 225–242 (1991)
4. Brockman, G., Kay, B., Snively, E.: On universal cycles of labeled graphs. Preprint.
arXiv:0808.3610
(2009)
5. Brockman, G., Kay, B., Snively, E.: On universal cycles of labeled graphs. Electron. J. Comb. 17, Research Paper No. R4 (2010)