Geodesic
On universal cycles of labeled graphs
The electronic journal of combinatorics, Tome 17 (2010)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/276
Classification : 05C78, 05C75, 05C45
Mots-clés : universal cycle, labeled graphs, de Bruijn cycles, arc digraph 
@article{10_37236_276,
     author = {Greg Brockman and Bill Kay and Emma E. Snively},
     title = {On universal cycles of labeled graphs},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/276},
     zbl = {1184.05110},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/276/}
}
TY  - JOUR
AU  - Greg Brockman
AU  - Bill Kay
AU  - Emma E. Snively
TI  - On universal cycles of labeled graphs
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/276/
DO  - 10.37236/276
ID  - 10_37236_276
ER  - 
%0 Journal Article
%A Greg Brockman
%A Bill Kay
%A Emma E. Snively
%T On universal cycles of labeled graphs
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/276/
%R 10.37236/276
%F 10_37236_276
Greg Brockman; Bill Kay; Emma E. Snively. On universal cycles of labeled graphs. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/276

Cité par Sources :