Geodesic
On the minimum number of components in a cotree of a graph
Mathematica slovaca, Tome 49 (1999) no. 2, pp. 129-135
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C05 
@article{MASLO_1999_49_2_a0,
     author = {\v{S}koviera, Martin},
     title = {On the minimum number of components in a cotree of a graph},
     journal = {Mathematica slovaca},
     pages = {129--135},
     year = {1999},
     volume = {49},
     number = {2},
     mrnumber = {1696962},
     zbl = {0958.05026},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1999_49_2_a0/}
}
TY  - JOUR
AU  - Škoviera, Martin
TI  - On the minimum number of components in a cotree of a graph
JO  - Mathematica slovaca
PY  - 1999
SP  - 129
EP  - 135
VL  - 49
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/MASLO_1999_49_2_a0/
LA  - en
ID  - MASLO_1999_49_2_a0
ER  - 
%0 Journal Article
%A Škoviera, Martin
%T On the minimum number of components in a cotree of a graph
%J Mathematica slovaca
%D 1999
%P 129-135
%V 49
%N 2
%U http://geodesic.mathdoc.fr/item/MASLO_1999_49_2_a0/
%G en
%F MASLO_1999_49_2_a0
Škoviera, Martin. On the minimum number of components in a cotree of a graph. Mathematica slovaca, Tome 49 (1999) no. 2, pp. 129-135. http://geodesic.mathdoc.fr/item/MASLO_1999_49_2_a0/

[1] BOLLOBÁS B.: Extremal Graph Theory. Academic Press, New York, 1978. | MR

[2] GLIVIAK F.: A new proof of one estimation. Istit. Lombardo Accad. Sci. Lett. Rend. A 110 (1976), 3-5. | MR

[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. | MR | Zbl

[4] NEBESKÝ L.: Characterization of the decay number of a connected graph. Math. Slovaca 45 (1995), 349-352. | MR | Zbl

[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. | MR | Zbl

[6] ŠIRÁŇ J.-ŠKOVIERA M.: Characterization of the maximum genus of a signed graph. J. Combin. Theory Ser. B 52 (1991), 124-146. | MR | Zbl

[7] ŠKOVIERA M.: The decay number and the maximum genus of a graph. Math. Slovaca 42 (1992), 391-406. | MR | Zbl