On universal cycles of labeled graphs (Q2380435): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:56, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On universal cycles of labeled graphs |
scientific article |
Statements
On universal cycles of labeled graphs (English)
0 references
26 March 2010
0 references
Summary: 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.
0 references
universal cycle
0 references
labeled graphs
0 references
de Bruijn cycles
0 references
arc digraph
0 references
