Geodesic
Drawing a graph in a hypercube
The electronic journal of combinatorics, Tome 13 (2006)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A $d$-dimensional hypercube drawing of a graph represents the vertices by distinct points in $\{0,1\}^d$, such that the line-segments representing the edges do not cross. We study lower and upper bounds on the minimum number of dimensions in hypercube drawing of a given graph. This parameter turns out to be related to Sidon sets and antimagic injections.
DOI : 10.37236/1099
Classification : 05C10, 05C62, 05C78, 11B83, 68R10
Mots-clés : hypercube drawing, Sidon sets, antimagic injections 
@article{10_37236_1099,
     author = {David R. Wood},
     title = {Drawing a graph in a hypercube},
     journal = {The electronic journal of combinatorics},
     year = {2006},
     volume = {13},
     doi = {10.37236/1099},
     zbl = {1098.05024},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1099/}
}
TY  - JOUR
AU  - David R. Wood
TI  - Drawing a graph in a hypercube
JO  - The electronic journal of combinatorics
PY  - 2006
VL  - 13
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1099/
DO  - 10.37236/1099
ID  - 10_37236_1099
ER  - 
%0 Journal Article
%A David R. Wood
%T Drawing a graph in a hypercube
%J The electronic journal of combinatorics
%D 2006
%V 13
%U http://geodesic.mathdoc.fr/articles/10.37236/1099/
%R 10.37236/1099
%F 10_37236_1099
David R. Wood. Drawing a graph in a hypercube. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1099

Cité par Sources :