Previous |  Up |  Next

Article

Title: On the minimum number of components in a cotree of a graph (English)
Author: Škoviera, Martin
Language: English
Journal: Mathematica Slovaca
ISSN: 0139-9918
Volume: 49
Issue: 2
Year: 1999
Pages: 129-135
.
Category: math
.
MSC: 05C05
idZBL: Zbl 0958.05026
idMR: MR1696962
.
Date available: 2009-09-25T11:35:36Z
Last updated: 2012-08-01
Stable URL: http://hdl.handle.net/10338.dmlcz/136746
.
Reference: [1] BOLLOBÁS B.: Extremal Graph Theory.Academic Press, New York, 1978. MR 0506522
Reference: [2] GLIVIAK F.: A new proof of one estimation.Istit. Lombardo Accad. Sci. Lett. Rend. A 110 (1976), 3-5. MR 0543830
Reference: [3] MURTY U. S. R.: Extremal nonseparable graphs of diameter 2.In: Proof Techniques in Graph Theory, Academic Press, New York, 1969, pp. 111-118. Zbl 0194.25403, MR 0255438
Reference: [4] NEBESKÝ L.: Characterization of the decay number of a connected graph.Math. Slovaca 45 (1995), 349-352. Zbl 0854.05089, MR 1387050
Reference: [5] PALUMBÍNY D.: Sul numero minimo degli spigoli di un singramma di raggio e diametro eguali a due.Istit. Lombardo Accad. Sci. Lett. Rend. A 106 (1972), 704-712. Zbl 0277.05133, MR 0327572
Reference: [6] ŠIRÁŇ J.-ŠKOVIERA M.: Characterization of the maximum genus of a signed graph.J. Combin. Theory Ser. B 52 (1991), 124-146. Zbl 0742.05037, MR 1109428
Reference: [7] ŠKOVIERA M.: The decay number and the maximum genus of a graph.Math. Slovaca 42 (1992), 391-406. Zbl 0760.05032, MR 1195033
.

Files

Files Size Format View
MathSlov_49-1999-2_1.pdf 422.9Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo