On Universal Cycles of Labeled Graphs

Citations Over TimeTop 17% of 2010 papers

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.

Related Papers

• → Max point-tolerance graphs(2015)35 cited
• → Distance Biregular Bipartite Graphs(1994)28 cited
• lambda-Coloring of Graphs(2000)
• → Intersection graphs of maximal hypercubes(2003)4 cited
• → Linear time algorithm for maximum distance-k matching in interval graphs(2018)1 cited