Geodesic
Recent results of Novosibirsk mathematicians in graph theory
Časopis pro pěstování matematiky, Tome 112 (1987) no. 1, pp. 89-96

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

DOI MR   Zbl

DOI : 10.21136/CPM.1987.118297
Classification : 05-03 
Mel'nikov, L. S. Recent results of Novosibirsk mathematicians in graph theory. Časopis pro pěstování matematiky, Tome 112 (1987) no. 1, pp. 89-96. doi: 10.21136/CPM.1987.118297
@article{10_21136_CPM_1987_118297,
     author = {Mel'nikov, L. S.},
     title = {Recent results of {Novosibirsk} mathematicians in graph theory},
     journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
     pages = {89--96},
     year = {1987},
     volume = {112},
     number = {1},
     doi = {10.21136/CPM.1987.118297},
     mrnumber = {880935},
     zbl = {0609.05001},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1987.118297/}
}
TY  - JOUR
AU  - Mel'nikov, L. S.
TI  - Recent results of Novosibirsk mathematicians in graph theory
JO  - Časopis pro pěstování matematiky
PY  - 1987
SP  - 89
EP  - 96
VL  - 112
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CPM.1987.118297/
DO  - 10.21136/CPM.1987.118297
LA  - en
ID  - 10_21136_CPM_1987_118297
ER  - 
%0 Journal Article
%A Mel'nikov, L. S.
%T Recent results of Novosibirsk mathematicians in graph theory
%J Časopis pro pěstování matematiky
%D 1987
%P 89-96
%V 112
%N 1
%U http://geodesic.mathdoc.fr/articles/10.21136/CPM.1987.118297/
%R 10.21136/CPM.1987.118297
%G en
%F 10_21136_CPM_1987_118297

[1] V. A. Aksionov: Degree of the perfectness of a graph (in Russian). Metody Diskret. Analiz., 41 (1984), 3-11.

[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.

[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

[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.

[5] O. V. Borodin L. S. Meľnikov: On chromatic number of pseudosurface. (in Russian), in sb. "Discrete Analiz", 24 (1974), 8-20. | MR

[6] R. L. Brooks: On coloring the nodes of a network. Proc. Cambridge Phil. Soc. 37 (1941), 194-197. | MR

[7] A. K. Dewdney: The chromatic number of a class of pseudo-2-manifolds. Manuscripta Math., 6 (1972), 311-319. | MR | Zbl

[8] M. C. Golumbic: Algorithmic graph theory and perfect graphs. Acad. Press, New York-London, 1980. | MR | Zbl

[9] P. Kainen: Chromatic number and skewness. J. Combin. Theory, Ser. B 18 (1975), 32-34. | MR | Zbl

[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

[11] A. V. Kostochka: Lower bound of the Hadwiger number of graphs by their average degree. Combinatorica 4 (1984), 307-316. | MR | Zbl

[12] L. S. Meľnikov: Some topological classifications of graphs, Recent Advances in graph theory. Academia, Prague, 1975, 365-383. 543.

[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

[14] L. S. Meľnikov K. V. Ponomarev: Extremal graphs with given primitivity. (in Russian), Metody Diskret. Analiz., 42 (1985). | MR

[15] G. Ringel: Ein Sechsfarbenproblem auf der Kugel. Abh. Math. Sem. Univ. Hamburg, 29(1965), 107-117. | MR | Zbl

[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

[17] V. A. Taškinov: Regular subgraphs of regular graphs. (in Russian), Dokl. Akad. Nauk SSSR, 265 (1982), 43-44.

[18] V. A. Taškinov: 3-regular subgraphs of 4-regular graphs. (in Russian), Matem, zametki, 36 (1984), 239-259. | MR

[19] V. G. Vizing: Some unsolved problems in graph theory. (in Russian), Uspekhi Mat. Nauk, 23 (1968), 117-134. | MR | Zbl

[20] B. Zelinka: Hadwiger numbers of finite graphs. Math. Slovaca, (26) 1 (1976), 23-30. | MR | Zbl

[21] B. Zelinka: On some graph-theoretical problems of V. G. Vizing. Čas. pěst. mat. 98 (1973), 56-66. | MR | Zbl

Cité par Sources :