@article{MASLO_1988_38_3_a0,
author = {Majcher, Zofia},
title = {Graphic matrices},
journal = {Mathematica slovaca},
pages = {193--205},
year = {1988},
volume = {38},
number = {3},
mrnumber = {977896},
zbl = {0662.05045},
language = {en},
url = {http://geodesic.mathdoc.fr/item/MASLO_1988_38_3_a0/}
}
Majcher, Zofia. Graphic matrices. Mathematica slovaca, Tome 38 (1988) no. 3, pp. 193-205. http://geodesic.mathdoc.fr/item/MASLO_1988_38_3_a0/
[1] BALABAN A. T., KEREK F.: Graphs of parallel and or substitution reactions. Rev. Roum de Chemie 19, 1974, No. 4, 631-647.
[2] BERGE C.: Gгaphs and Hypergraphs. North-Holland, Amsterdam 1973. | MR
[3] EGGLETON R. B.: Graphic sequences and graphic polynomials: a report. Infinite and Finite Sets. Colloqu. Math. Soc. J. Bolyai 10, 1973, 385-392. | MR
[4] EGGLETON R. B., HOLTON D. A.: Graphic sequences. Combinatorial Math. VI. Proc. бth Australian Conf. on Combinatorial Math., Armidale, 1978, Springer-Verlag 1979, 1-10. | MR
[5] EGGLETON R. B., HOLTON D. A.: Simple and multigraphic realizations of degree sequences. Combinatorial Math. VIII. Proc. Geelong, Australia 1980, Springer-Verlag 1981, 155-172. | MR
[6] ERDÖS P., GALLAI T.: Graphs with prescribed degrees of vertices (in Hungarian). Mat. Lapok 11, 1960, 264-274.
[7] EVANS C. W.: Some properties of semi-regular graphs. match 6, 1979, 117-135. | MR | Zbl
[8] GALE D.: A theorem in folows in networks. Pacific J. Math. 7, 1957, 1073-1082. | MR
[9] HAKIMI S. L.: On the realizability of a set of integers as degrees of the vertices of a linear graph. I. J. SIAM 10, 1962, 496-506. | MR
[10] HARARY F.: Graph Theory. Addison-Vesley, Mass. 1969. | MR | Zbl
[11] HAVEL V.: A remark on the existence of finite graphs (in Czech). Čas. pěst. mat. 80, 1955, 477-480.
[12] MAJCHER Z.: Matrices representable by graphs.: Teubner-Texte zur Mathematik. Band 59, Proc. of the Third Czechoslovak Symposium on Graph Theory, Prague 1982, BSB B. G. Teubner Verlagsgesellschaft, 1983, 178-182. | MR
[13] MAJCHER Z.: On some regularities of graphs II. Čas. pӗst. mat. 109, 1984, 380-388. | MR | Zbl
[14] MAJCHER Z.: Algorithms for constructing paths in a graph of realizations of a degree sequence. (to appear).
[15] PŁONKA J.: On Г-regular graphs. Colloquium Math. 46, 1982, 131-134. | MR
[16] PŁONKA J.: On some regularities of graphs I. Čas. pӗst. mat. 107, 1982, 231-240. | MR
[17] RAMA CHANDRAN S.: Nearly regular graphs and their reconstruction. Graph Theory Newsletter B, 3, 1978.
[18] TAYLOR R.: Constrained switchings in graphs. Combinatorial Math. VIII. Proc. Geelong, Australia 1980, Springer-Verlag 1981, 314-336. | MR