On universal cycles of labeled graphs (Q2380435)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On universal cycles of labeled graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8625309467315674
0 references
0.8469139933586121
0 references
0.829510509967804
0 references
0.8245541453361511
0 references
0.823819100856781
0 references
