On Universal Cycles of Labeled Graphs
Combinatorics
2009-11-02 v2
Abstract
A universal cycle is a compact listing of a class of combinatorial objects. In this paper, we prove the existence of universal cycles of classes of labeled graphs, including simple graphs, trees, graphs with m edges, graphs with loops, graphs with multiple edges (with up to m duplications of each edge), directed graphs, hypergraphs, and k-uniform hypergraphs.
Keywords
Cite
@article{arxiv.0808.3610,
title = {On Universal Cycles of Labeled Graphs},
author = {Greg Brockman and Bill Kay and Emma E. Snively},
journal= {arXiv preprint arXiv:0808.3610},
year = {2009}
}
Comments
9 pages, 8 figures