On tree-complete graphs
Časopis pro pěstování matematiky, Tome 100 (1975) no. 4, pp. 334-338
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
Nebeský, Ladislav. On tree-complete graphs. Časopis pro pěstování matematiky, Tome 100 (1975) no. 4, pp. 334-338. doi: 10.21136/CPM.1975.117886
@article{10_21136_CPM_1975_117886,
author = {Nebesk\'y, Ladislav},
title = {On tree-complete graphs},
journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
pages = {334--338},
year = {1975},
volume = {100},
number = {4},
doi = {10.21136/CPM.1975.117886},
mrnumber = {0414444},
zbl = {0313.05101},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1975.117886/}
}
[1] M. Behzad G. Chartrand: No graph is perfect. Amer. Math. Monthly 74 (1967), 962-963. | MR
[2] M. Behzad G. Chartrand: Introduction to the Theory of Graphs. Allyn and Bacon, Inc., Boston 1971. | MR
[3] /. Sedláček: O perfektních a kvaziperfektních grafech. Čas. pěst. mat. 100 (1975), 135 - 141. | MR
Cité par Sources :