A characterization of the decay number of a connected graph
Mathematica slovaca, Tome 45 (1995) no. 4, pp. 349-352
@article{MASLO_1995_45_4_a2,
author = {Nebesk\'y, Ladislav},
title = {A characterization of the decay number of a connected graph},
journal = {Mathematica slovaca},
pages = {349--352},
year = {1995},
volume = {45},
number = {4},
mrnumber = {1387050},
zbl = {0854.05089},
language = {en},
url = {http://geodesic.mathdoc.fr/item/MASLO_1995_45_4_a2/}
}
Nebeský, Ladislav. A characterization of the decay number of a connected graph. Mathematica slovaca, Tome 45 (1995) no. 4, pp. 349-352. http://geodesic.mathdoc.fr/item/MASLO_1995_45_4_a2/
[1] BEHZAD M., CHARTRAND G., LESNIAK-FOSTER L.: Graphs & Digraphs. Prindle, Weber & Schmidt, Boston, 1979. | MR | Zbl
[2] NASH-WILLIAMS C. ST. J. A.: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. 36 (1961), 445-450. | MR | Zbl
[3] ŠKOVIERA M.: The decay number and the maximum genus of a graph. Math. Slovaca 42 (1992), 391-406. | MR | Zbl
[4] TUTTE W. T.: On the problem of decomposing a graph into n connected factors. J. London Math. Soc. 36 (1961), 221-230. | MR | Zbl