Previous |  Up |  Next

Article

Title: The tree-covering number of a graph (English)
Author: Foregger, Marsha F.
Author: Foregger, Thomas H.
Language: English
Journal: Czechoslovak Mathematical Journal
ISSN: 0011-4642 (print)
ISSN: 1572-9141 (online)
Volume: 30
Issue: 4
Year: 1980
Pages: 633-639
Summary lang: Russian
.
Category: math
.
MSC: 05C05
MSC: 05C70
idZBL: Zbl 0473.05048
idMR: MR592326
DOI: 10.21136/CMJ.1980.101711
.
Date available: 2008-06-09T14:41:41Z
Last updated: 2020-07-28
Stable URL: http://hdl.handle.net/10338.dmlcz/101711
.
Reference: [1] K. Chartrand, M. Behzad: "Introduction to the Theory of Graphs,".Allyn and Bacon, Boston, 1971. Zbl 0238.05101, MR 0432461
Reference: [2] E. A. Nordhaus, J. W. Gaddum: On complementary graphs.Amer. Math. Monthly 63 (1956), 175-177. Zbl 0070.18503, MR 0078685, 10.2307/2306658
Reference: [3] 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.
Reference: [4] W. T. Tutte: "Connectivity in Graphs,".University of Toronto Press, Toronto, 1966. Zbl 0146.45603, MR 0210617
.

Files

Files Size Format View
CzechMathJ_30-1980-4_11.pdf 850.8Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo