Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
Sedláček, Jiří. O perfektních a kvaziperfektních grafech. Časopis pro pěstování matematiky, Tome 100 (1975) no. 2, pp. 135-141. doi: 10.21136/CPM.1975.108773
@article{10_21136_CPM_1975_108773,
author = {Sedl\'a\v{c}ek, Ji\v{r}{\'\i}},
title = {O perfektn{\'\i}ch a kvaziperfektn{\'\i}ch grafech},
journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
pages = {135--141},
year = {1975},
volume = {100},
number = {2},
doi = {10.21136/CPM.1975.108773},
mrnumber = {0416994},
zbl = {0299.05104},
language = {cs},
url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1975.108773/}
}
[1] M. Behzad G. Chartrand: Introduction to the theory of graphs. Allyn and Bacon Inc. Boston 1971. | MR
[2] M. Behzad G. Chartrand: No graph is perfect. Amer. Math. Monthly 74 (1967), 962-963. | MR
[3] V. N. Bhat: Characterization of 3-perfect graphical degree sequences. Graph Theory Newsletter, Vol. 1, No 4 (1972), Abstract 5.
[4] K. Čulík V. Doležal M. Fiedler: Kombinatorická analýza v praxi. Praha 1967.
[5] S. L. Hakimi: On the readability of a set of integers as degrees of the vertices of a linear graph. J. SIAM, 10 (1962), 496-506. | MR
[6] V. Havel: Poznámka o existenci konečných grafů. Časopis pro pěstování matematiky 80 (1955), 477-480. | MR
[7] L. Nebeský: On connected graphs containing exactly two points of the same degree. Časopis pro pěstování matematiky 98 (1973), 305-306. | MR
[8] H. Sachs: Einfuhrung in die Theorie der endlichen Graphen I. Leipzig 1970, II., Leipzig 1972. | MR
[9] J. Sedláček: Kombinatorika v teorii a praxi (Úvod do teorie grafů). Praha 1964. | MR
Cité par Sources :