\magnification=1200
\hsize=4in
\overfullrule=0pt
\input amssym
%\def\frac#1 #2 {{#1\over #2}}
\def\emph#1{{\it #1}}
\def\em{\it}
\nopagenumbers
\noindent
%
%
{\bf Greg Brockman, Bill Kay and Emma E. Snively}
%
%
\medskip
\noindent
%
%
{\bf On Universal Cycles of Labeled Graphs}
%
%
\vskip 5mm
\noindent
%
%
%
%
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.
\bye