The tree-covering number of a graph
Marsha F. Foregger; Thomas H. Foregger
Czechoslovak Mathematical Journal (1980)
- Volume: 30, Issue: 4, page 633-639
- ISSN: 0011-4642
Access Full Article
top
How to cite
topForegger, Marsha F., and Foregger, Thomas H.. "The tree-covering number of a graph." Czechoslovak Mathematical Journal 30.4 (1980): 633-639. <http://eudml.org/doc/13229>.
@article{Foregger1980,
author = {Foregger, Marsha F., Foregger, Thomas H.},
journal = {Czechoslovak Mathematical Journal},
keywords = {vertex partition},
language = {eng},
number = {4},
pages = {633-639},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {The tree-covering number of a graph},
url = {http://eudml.org/doc/13229},
volume = {30},
year = {1980},
}
TY - JOUR
AU - Foregger, Marsha F.
AU - Foregger, Thomas H.
TI - The tree-covering number of a graph
JO - Czechoslovak Mathematical Journal
PY - 1980
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 30
IS - 4
SP - 633
EP - 639
LA - eng
KW - vertex partition
UR - http://eudml.org/doc/13229
ER -
References
top- K. Chartrand, M. Behzad, "Introduction to the Theory of Graphs,", Allyn and Bacon, Boston, 1971. (1971) Zbl0238.05101MR0432461
- E. A. Nordhaus, J. W. Gaddum, 10.2307/2306658, Amer. Math. Monthly 63 (1956), 175-177. (1956) Zbl0070.18503MR0078685DOI10.2307/2306658
- E. J. Roberts, The fully indecomposable matrix and its associated bipartite graph - An investigation of combinatorial and structural properties, NASA Technical Memorandum TMX-58037, January 1970. (1970)
- W. T. Tutte, "Connectivity in Graphs,", University of Toronto Press, Toronto, 1966. (1966) Zbl0146.45603MR0210617
NotesEmbed ?
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.