Geodesic
Bounds on the Coarseness of the n-Cube
Canadian mathematical bulletin, Tome 22 (1979) no. 2, pp. 171-175

Voir la notice de l'article provenant de la source Cambridge

DOI

The coarseness, c(G), of a graph G is the maximum number of edge disjoint nonplanar subgraphs contained in G For the n-dimensional cube Q n we obtain the inequalities 
Hartman, Jehuda. Bounds on the Coarseness of the n-Cube. Canadian mathematical bulletin, Tome 22 (1979) no. 2, pp. 171-175. doi: 10.4153/CMB-1979-024-2
@article{10_4153_CMB_1979_024_2,
     author = {Hartman, Jehuda},
     title = {Bounds on the {Coarseness} of the {n-Cube}},
     journal = {Canadian mathematical bulletin},
     pages = {171--175},
     year = {1979},
     volume = {22},
     number = {2},
     doi = {10.4153/CMB-1979-024-2},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1979-024-2/}
}
TY  - JOUR
AU  - Hartman, Jehuda
TI  - Bounds on the Coarseness of the n-Cube
JO  - Canadian mathematical bulletin
PY  - 1979
SP  - 171
EP  - 175
VL  - 22
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1979-024-2/
DO  - 10.4153/CMB-1979-024-2
ID  - 10_4153_CMB_1979_024_2
ER  - 
%0 Journal Article
%A Hartman, Jehuda
%T Bounds on the Coarseness of the n-Cube
%J Canadian mathematical bulletin
%D 1979
%P 171-175
%V 22
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1979-024-2/
%R 10.4153/CMB-1979-024-2
%F 10_4153_CMB_1979_024_2

Cité par Sources :