Geodesic
On the Orchard crossing number of the complete bipartite graphs
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We compute the Orchard crossing number, which is defined in a similar way to the rectilinear crossing number, for the complete bipartite graphs $K_{n,n}$.
DOI : 10.37236/688
Classification : 05C62 
@article{10_37236_688,
     author = {Elie Feder and David Garber},
     title = {On the {Orchard} crossing number of the complete bipartite graphs},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/688},
     zbl = {1337.05079},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/688/}
}
TY  - JOUR
AU  - Elie Feder
AU  - David Garber
TI  - On the Orchard crossing number of the complete bipartite graphs
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/688/
DO  - 10.37236/688
ID  - 10_37236_688
ER  - 
%0 Journal Article
%A Elie Feder
%A David Garber
%T On the Orchard crossing number of the complete bipartite graphs
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/688/
%R 10.37236/688
%F 10_37236_688
Elie Feder; David Garber. On the Orchard crossing number of the complete bipartite graphs. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/688

Cité par Sources :