Previous |  Up |  Next

Article

References:
[1] M. Behzad G. Chartrand: Introduction to the theory of graphs. Allyn and Bacon Inc. Boston 1971. MR 0432461
[2] M. Behzad G. Chartrand: No graph is perfect. Amer. Math. Monthly 74 (1967), 962-963. MR 0220627
[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 0148049
[6] V. Havel: Poznámka o existenci konečných grafů. Časopis pro pěstování matematiky 80 (1955), 477-480. MR 0089165
[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 0321813
[8] H. Sachs: Einfuhrung in die Theorie der endlichen Graphen I. Leipzig 1970, II., Leipzig 1972. MR 0345857
[9] J. Sedláček: Kombinatorika v teorii a praxi (Úvod do teorie grafů). Praha 1964. MR 0190035
Partner of
EuDML logo