Geodesic
Domination in $n$-cubes with diagonals
Mathematica slovaca, Tome 48 (1998) no. 2, pp. 105-115
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C69 
@article{MASLO_1998_48_2_a0,
     author = {Havel, Ivan},
     title = {Domination in $n$-cubes with diagonals},
     journal = {Mathematica slovaca},
     pages = {105--115},
     year = {1998},
     volume = {48},
     number = {2},
     mrnumber = {1647646},
     zbl = {0939.05062},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1998_48_2_a0/}
}
TY  - JOUR
AU  - Havel, Ivan
TI  - Domination in $n$-cubes with diagonals
JO  - Mathematica slovaca
PY  - 1998
SP  - 105
EP  - 115
VL  - 48
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/MASLO_1998_48_2_a0/
LA  - en
ID  - MASLO_1998_48_2_a0
ER  - 
%0 Journal Article
%A Havel, Ivan
%T Domination in $n$-cubes with diagonals
%J Mathematica slovaca
%D 1998
%P 105-115
%V 48
%N 2
%U http://geodesic.mathdoc.fr/item/MASLO_1998_48_2_a0/
%G en
%F MASLO_1998_48_2_a0
Havel, Ivan. Domination in $n$-cubes with diagonals. Mathematica slovaca, Tome 48 (1998) no. 2, pp. 105-115. http://geodesic.mathdoc.fr/item/MASLO_1998_48_2_a0/

[1] BERRACHEDI A.-HAVEL I.-MULDER H. M.: Spherical and clockwise spherical graphs. Report 9456/B, Erasmus University Rotterdam, 1994.

[2] COCKAYNE E. J.-HEDETNIEMI S. T.: Towards a theory of domination in graphs. Networks 7 (1977), 247-271. | MR

[3] DVOŘÁK T.-HAVEL I.-LABORDE, J-M.-LIEBL P.: Generalized hypercubes and graph embedding with dilation. Rostocker Mathem. Kolloquium 39 (1990), 13-20. | MR | Zbl

[4] HARARY F.: Four difficult unsolved problems in graph theory. In: Recent Advances in Graph Theory (M. Fiedler, ed.), Academia, Praha, 1974, pp. 249-256. | MR

[5] LABORDE, J-M.: Sur le Nombre Domatique du n-Cube et Une Conjecture de Zelinka. European J. Combin. 8 (1987), 175-177. | MR | Zbl

[6] MOLLARD M.: Les invariants du n-cube. These de 3e cycle, IMAG, Grenoble, 1981.

[7] MULDER H. M.: The interval function of a graph. Mathematical Centre Tracts 132, Mathematisch Centrum, Amsterdam, 1980. | MR | Zbl

[8] PAYAN, CH.: On the chromatic number of cube-like graphs. Discrete Math. 103 (1992), 271-277. | MR | Zbl

[9] SLOANE N. J. A.-Mac-WILLIAMS F. J.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam, 1978.

[10] SOKOLOVÁ M.: The chromatic number of extended odd graphs is four. Časopis Pěst. Mat. 112 (1987), 308-311. | MR | Zbl

[11] ZELINKA B.: Domatically critical graphs. Czechoslovak Math. J. 30 (1980), 468-489. | MR | Zbl

[12] ZELINKA B.: Domatic numbers of cube graphs. Math. Slovaca 32 (1982), 117-119. | MR | Zbl