Geodesic
The Hadwiger number of complements of some graphs
Mathematica slovaca, Tome 47 (1997) no. 4, pp. 393-403

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

MR Zbl
Classification : 05C35, 05C40 
Ivančo, Jaroslav. The Hadwiger number of complements of some graphs. Mathematica slovaca, Tome 47 (1997) no. 4, pp. 393-403. http://geodesic.mathdoc.fr/item/MASLO_1997_47_4_a1/
@article{MASLO_1997_47_4_a1,
     author = {Ivan\v{c}o, Jaroslav},
     title = {The {Hadwiger} number of complements of some graphs},
     journal = {Mathematica slovaca},
     pages = {393--403},
     year = {1997},
     volume = {47},
     number = {4},
     mrnumber = {1796952},
     zbl = {0958.05066},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1997_47_4_a1/}
}
TY  - JOUR
AU  - Ivančo, Jaroslav
TI  - The Hadwiger number of complements of some graphs
JO  - Mathematica slovaca
PY  - 1997
SP  - 393
EP  - 403
VL  - 47
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/MASLO_1997_47_4_a1/
LA  - en
ID  - MASLO_1997_47_4_a1
ER  - 
%0 Journal Article
%A Ivančo, Jaroslav
%T The Hadwiger number of complements of some graphs
%J Mathematica slovaca
%D 1997
%P 393-403
%V 47
%N 4
%U http://geodesic.mathdoc.fr/item/MASLO_1997_47_4_a1/
%G en
%F MASLO_1997_47_4_a1

[1] HARARY F.: Graph Theory. Addison-Wesley, Reading, Mass., 1969. | MR | Zbl

[2] IVANČO J.: Some results on the Hadwiger numbers of graphs. Math. Slovaca 38 (1988), 221-226. | MR | Zbl

[3] STIEBITZ M.: On Hadwiger's number-A problem ofthe Nordhaus-Gaddum type. Discrete Math. 101 (1992), 307-317. | MR

[4] TUTTE W. T.: The factorizations of linear graphs. J. London Math. Soc. 22 (1947), 107-111. | MR

[5] VIZING V. G.: Some unsolved problems of graph theory. Uspekhi Mat. Nauk 23 (1968), 117-134. (Russian) | MR

[6] ZELINKA B.: On some graph-theoretical problems of V. G. Vizing. Časopis Pěst. Mat. 98 (1973), 56-66. | MR | Zbl

[7] ZELINKA B.: Hadwiger numbers of finite graphs. Math. Slovaca 26 (1976), 23-30. | MR | Zbl

[8] ZYKOV A. A.: On the number of edges of a graph with Hadwiger number at most 4. Prikl. Mat. i Programmirovanie 7 (1972), 52-55. (Russian) | MR