go-v.orgdoi

On Universal Cycles of Labeled Graphs

Greg Brockman, Bill Kay, Emma E. Snively · The Electronic Journal of Combinatorics · 2010

  • DOI 10.37236/276
  • Publisher Electronic Journal of Combinatorics
  • Type article
  • Issued 2010

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2010

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.

Open the resolved locator · 10.37236/276

Metadata licence: OpenAlex metadata (CC0)