Previous |  Up |  Next

Article

Title: Recent results of Novosibirsk mathematicians in graph theory (English)
Author: Mel'nikov, L. S.
Language: English
Journal: Časopis pro pěstování matematiky
ISSN: 0528-2195
Volume: 112
Issue: 1
Year: 1987
Pages: 89-96
Summary lang: English
Summary lang: Czech
Summary lang: Russian
.
Category: math
.
MSC: 05-03
idZBL: Zbl 0609.05001
idMR: MR880935
DOI: 10.21136/CPM.1987.118297
.
Date available: 2009-09-23T09:40:23Z
Last updated: 2020-07-29
Stable URL: http://hdl.handle.net/10338.dmlcz/118297
.
Reference: [1] V. A. Aksionov: Degree of the perfectness of a graph (in Russian).Metody Diskret. Analiz., 41 (1984), 3-11.
Reference: [2] V. A. Aksionov: Generalization of some bounds of the chromatic number of graphs.(in Russian), 30. Intern. Wiss. Koll. TH Ilmenau 1985 "Graphen und Netzwerke - Theorie und Anwendungen", 3 - 5.
Reference: [3] O. V. Borodin: Solution of Ringel's problems on vertex-face colouring of planar graphs and on vertex colouring of 1-planar graphs.(in Russian), Metody Diskret. Analiz., 41 (1984), 12-26. MR 0832128
Reference: [4] O. V. Borodin: Combined colourings and colourings of 1-embedded graphs.(in Russian), 30. Intern. Wiss. Koll. TH Ilmenau 1985 "Graphen und Netzwerke - Theorie und Anwendungen", 19-20.
Reference: [5] O. V. Borodin L. S. Meľnikov: On chromatic number of pseudosurface.(in Russian), in sb. "Discrete Analiz", 24 (1974), 8-20. MR 0369125
Reference: [6] R. L. Brooks: On coloring the nodes of a network.Proc. Cambridge Phil. Soc. 37 (1941), 194-197. MR 0012236
Reference: [7] A. K. Dewdney: The chromatic number of a class of pseudo-2-manifolds.Manuscripta Math., 6 (1972), 311-319. Zbl 0229.05112, MR 0295961
Reference: [8] M. C. Golumbic: Algorithmic graph theory and perfect graphs.Acad. Press, New York-London, 1980. Zbl 0541.05054, MR 0562306
Reference: [9] P. Kainen: Chromatic number and skewness.J. Combin. Theory, Ser. B 18 (1975), 32-34. Zbl 0298.05116, MR 0369131
Reference: [10] A. V. Kostochka: On Hadwiger numbers of a graph and its complement.Coll. Math. Soc. J. Bolyai, 37 "Finite and infinite sets" (Eger, Hungary, 1981), 537-545. MR 0818256
Reference: [11] A. V. Kostochka: Lower bound of the Hadwiger number of graphs by their average degree.Combinatorica 4 (1984), 307-316. Zbl 0555.05030, MR 0779891
Reference: [12] L. S. Meľnikov: Some topological classifications of graphs, Recent Advances in graph theory.Academia, Prague, 1975, 365-383. 543.
Reference: [13] L. S. Meľnikov V. V. Ponomarev: Solution of a Tuvan's type problem.(in Russian), Metody Diskret. Analiz., 41 (1984), 62-71. MR 0832132
Reference: [14] L. S. Meľnikov K. V. Ponomarev: Extremal graphs with given primitivity.(in Russian), Metody Diskret. Analiz., 42 (1985). MR 0890691
Reference: [15] G. Ringel: Ein Sechsfarbenproblem auf der Kugel.Abh. Math. Sem. Univ. Hamburg, 29(1965), 107-117. Zbl 0132.20701, MR 0187232
Reference: [16] G. Ringel: A nine color theorem for the torus and the Klein bottle, "The theory and applications of graphs".(Kalamazoo, Mich. 1980) New York, 1981, 507-515. MR 0634551
Reference: [17] V. A. Taškinov: Regular subgraphs of regular graphs.(in Russian), Dokl. Akad. Nauk SSSR, 265 (1982), 43-44.
Reference: [18] V. A. Taškinov: 3-regular subgraphs of 4-regular graphs.(in Russian), Matem, zametki, 36 (1984), 239-259. MR 0759437
Reference: [19] V. G. Vizing: Some unsolved problems in graph theory.(in Russian), Uspekhi Mat. Nauk, 23 (1968), 117-134. Zbl 0192.60502, MR 0240000
Reference: [20] B. Zelinka: Hadwiger numbers of finite graphs.Math. Slovaca, (26) 1 (1976), 23-30. Zbl 0324.05120, MR 0427145
Reference: [21] B. Zelinka: On some graph-theoretical problems of V. G. Vizing.Čas. pěst. mat. 98 (1973), 56-66. Zbl 0256.05116, MR 0319814
.

Files

Files Size Format View
CasPestMat_112-1987-1_7.pdf 858.1Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo