A characterization of the decay number of a connected graph
Mathematica Slovaca (1995)
- Volume: 45, Issue: 4, page 349-352
- ISSN: 0232-0525
Access Full Article
top
How to cite
topNebeský, Ladislav. "A characterization of the decay number of a connected graph." Mathematica Slovaca 45.4 (1995): 349-352. <http://eudml.org/doc/31652>.
@article{Nebeský1995,
author = {Nebeský, Ladislav},
journal = {Mathematica Slovaca},
keywords = {decay number; spanning tree; number of components; cotree},
language = {eng},
number = {4},
pages = {349-352},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {A characterization of the decay number of a connected graph},
url = {http://eudml.org/doc/31652},
volume = {45},
year = {1995},
}
TY - JOUR
AU - Nebeský, Ladislav
TI - A characterization of the decay number of a connected graph
JO - Mathematica Slovaca
PY - 1995
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 45
IS - 4
SP - 349
EP - 352
LA - eng
KW - decay number; spanning tree; number of components; cotree
UR - http://eudml.org/doc/31652
ER -
References
top- BEHZAD M., CHARTRAND G., LESNIAK-FOSTER L., Graphs & Digraphs, Prindle, Weber & Schmidt, Boston, 1979. (1979) Zbl0403.05027MR0525578
- NASH-WILLIAMS C. ST. J. A., Edge-disjoint spanning trees of finite graphs, J. London Math. Soc. 36 (1961), 445-450. (1961) Zbl0102.38805MR0133253
- ŠKOVIERA M., The decay number and the maximum genus of a graph, Math. Slovaca 42 (1992), 391-406. (1992) Zbl0760.05032MR1195033
- TUTTE W. T., On the problem of decomposing a graph into n connected factors, J. London Math. Soc. 36 (1961), 221-230. (1961) Zbl0096.38001MR0140438
Citations in EuDML Documents
topNotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.