Previous |  Up |  Next

Article

Title: The Hadwiger number of complements of some graphs (English)
Author: Ivančo, Jaroslav
Language: English
Journal: Mathematica Slovaca
ISSN: 0139-9918
Volume: 47
Issue: 4
Year: 1997
Pages: 393-403
.
Category: math
.
MSC: 05C35
MSC: 05C40
idZBL: Zbl 0958.05066
idMR: MR1796952
.
Date available: 2009-09-25T11:24:07Z
Last updated: 2012-08-01
Stable URL: http://hdl.handle.net/10338.dmlcz/133144
.
Reference: [1] HARARY F.: Graph Theory.Addison-Wesley, Reading, Mass., 1969. Zbl 0196.27202, MR 0256911
Reference: [2] IVANČO J.: Some results on the Hadwiger numbers of graphs.Math. Slovaca 38 (1988), 221-226. Zbl 0658.05038, MR 0977899
Reference: [3] STIEBITZ M.: On Hadwiger's number-A problem ofthe Nordhaus-Gaddum type.Discrete Math. 101 (1992), 307-317. MR 1172386
Reference: [4] TUTTE W. T.: The factorizations of linear graphs.J. London Math. Soc. 22 (1947), 107-111. MR 0023048
Reference: [5] VIZING V. G.: Some unsolved problems of graph theory.Uspekhi Mat. Nauk 23 (1968), 117-134. (Russian) MR 0240000
Reference: [6] ZELINKA B.: On some graph-theoretical problems of V. G. Vizing.Časopis Pěst. Mat. 98 (1973), 56-66. Zbl 0256.05116, MR 0319814
Reference: [7] ZELINKA B.: Hadwiger numbers of finite graphs.Math. Slovaca 26 (1976), 23-30. Zbl 0324.05120, MR 0427145
Reference: [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 0309793
.

Files

Files Size Format View
MathSlov_47-1997-4_2.pdf 985.0Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo