The tree-covering number of a graph
Czechoslovak Mathematical Journal, Tome 30 (1980) no. 4, pp. 633-639
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
@article{10_21136_CMJ_1980_101711,
author = {Foregger, Marsha F. and Foregger, Thomas H.},
title = {The tree-covering number of a graph},
journal = {Czechoslovak Mathematical Journal},
pages = {633--639},
year = {1980},
volume = {30},
number = {4},
doi = {10.21136/CMJ.1980.101711},
mrnumber = {592326},
zbl = {0473.05048},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1980.101711/}
}
TY - JOUR AU - Foregger, Marsha F. AU - Foregger, Thomas H. TI - The tree-covering number of a graph JO - Czechoslovak Mathematical Journal PY - 1980 SP - 633 EP - 639 VL - 30 IS - 4 UR - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1980.101711/ DO - 10.21136/CMJ.1980.101711 LA - en ID - 10_21136_CMJ_1980_101711 ER -
Foregger, Marsha F.; Foregger, Thomas H. The tree-covering number of a graph. Czechoslovak Mathematical Journal, Tome 30 (1980) no. 4, pp. 633-639. doi: 10.21136/CMJ.1980.101711
[1] K. Chartrand, M. Behzad: "Introduction to the Theory of Graphs,". Allyn and Bacon, Boston, 1971. | MR | Zbl
[2] E. A. Nordhaus, J. W. Gaddum: On complementary graphs. Amer. Math. Monthly 63 (1956), 175-177. | DOI | MR | Zbl
[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.
[4] W. T. Tutte: "Connectivity in Graphs,". University of Toronto Press, Toronto, 1966. | MR | Zbl
Cité par Sources :