Title:
|
A characterization of the decay number of a connected graph (English) |
Author:
|
Nebeský, Ladislav |
Language:
|
English |
Journal:
|
Mathematica Slovaca |
ISSN:
|
0139-9918 |
Volume:
|
45 |
Issue:
|
4 |
Year:
|
1995 |
Pages:
|
349-352 |
. |
Category:
|
math |
. |
MSC:
|
05C35 |
MSC:
|
05C70 |
idZBL:
|
Zbl 0854.05089 |
idMR:
|
MR1387050 |
. |
Date available:
|
2009-09-25T11:09:01Z |
Last updated:
|
2012-08-01 |
Stable URL:
|
http://hdl.handle.net/10338.dmlcz/128876 |
. |
Reference:
|
[1] BEHZAD M., CHARTRAND G., LESNIAK-FOSTER L.: Graphs & Digraphs.Prindle, Weber & Schmidt, Boston, 1979. Zbl 0403.05027, MR 0525578 |
Reference:
|
[2] NASH-WILLIAMS C. ST. J. A.: Edge-disjoint spanning trees of finite graphs.J. London Math. Soc. 36 (1961), 445-450. Zbl 0102.38805, MR 0133253 |
Reference:
|
[3] ŠKOVIERA M.: The decay number and the maximum genus of a graph.Math. Slovaca 42 (1992), 391-406. Zbl 0760.05032, MR 1195033 |
Reference:
|
[4] TUTTE W. T.: On the problem of decomposing a graph into n connected factors.J. London Math. Soc. 36 (1961), 221-230. Zbl 0096.38001, MR 0140438 |
. |