Vizing Vadim Georgievich

Publications in Math-Net.Ru

1. On coloring problems for the two-season multigraphs
   
   Diskretn. Anal. Issled. Oper., 22:2 (2015),  17–26
2. On multicoloring of incidentors of a weighted oriented multigraph
   
   Diskretn. Anal. Issled. Oper., 21:4 (2014),  33–41
3. Half-chromatic number of graph
   
   Diskretn. Anal. Issled. Oper., 20:1 (2013),  3–11
4. Multicoloring of incidentors of weighted undirected multigraph
   
   Diskretn. Anal. Issled. Oper., 19:4 (2012),  35–47
5. Multicriterial graph problems with MAXMIN criterion
   
   Diskretn. Anal. Issled. Oper., 18:5 (2011),  3–10
6. On one twocriterial graph problem
   
   Diskretn. Anal. Issled. Oper., 16:5 (2009),  34–40
7. Vertex colorings of graph with the majority restrictions on the consuming colors
   
   Diskretn. Anal. Issled. Oper., 16:4 (2009),  21–30
8. О раскраске инциденторов в частично ориентированном мультиграфе
   
   Diskretn. Anal. Issled. Oper., 15:1 (2008),  17–22
9. О мультираскраске вершин взвешенных графов
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 14:4 (2007),  16–26
10. О раскраске инциденторов в гиперграфе
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 14:3 (2007),  40–45
11. Об оценках инциденторного хроматического числа взвешенного неориентированного мультиграфа
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 14:2 (2007),  3–15
12. On bounds for the incidentor chromatic number of a directed weighted multigraph
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 13:4 (2006),  18–25
13. On the coloring of incidentors in an oriented weighted multigraph
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 13:1 (2006),  33–44
14. On the $(p,q)$-coloring of incidentors of an undirected multigraph
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 12:4 (2005),  23–39
15. Strict coloring of incidentors in undirected multigraphs
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 12:3 (2005),  48–53
16. Factor coloring of multigraph edges
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 11:2 (2004),  18–31
17. On linear factors of multigraphs
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 10:4 (2003),  3–7
18. Interval colorings of the incidentors of an undirected multigraph
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 10:1 (2003),  14–40
19. A bipartite interpretation of a directed multigraph in problems of the coloring of incidentors
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 9:1 (2002),  27–41
20. The coloring of the incidentors and vertices of an undirected multigraph
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 8:3 (2001),  3–14
21. Interval coloring of the incidentors of a directed multigraph
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 8:2 (2001),  40–51
22. On the $(k,l)$-coloring of incidentors
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 7:4 (2000),  29–37
23. The coloring of the incidentors and vertices of a directed multigraph
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 7:3 (2000),  6–16
24. The coloring of the incidentors of a multigraph into prescribed colors
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 7:1 (2000),  32–39
25. On the connected coloring of graphs in prescribed colors
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 6:4 (1999),  36–43
26. Distributive coloring of graph vertices
    
    Diskretn. Anal. Issled. Oper., 2:4 (1995),  3–12
27. Schedules that ensure the most uniform machine loading
    
    Dokl. Akad. Nauk SSSR, 280:3 (1985),  525–528
28. The intensification problem for deterministic maintenance systems
    
    Dokl. Akad. Nauk SSSR, 267:1 (1982),  27–30
29. Minimization of the maximum delay in servicing systems with interruption
    
    Zh. Vychisl. Mat. Mat. Fiz., 22:3 (1982),  717–722
30. О минимальной связности графов с транзитивной группой автоморфизмов
    
    Upravliaemie systemy, 1970, no. 7,  46–50
31. Some unsolved problems in graph theory
    
    Uspekhi Mat. Nauk, 23:6(144) (1968),  117–134
32. On the number of edges in a graph with a given radius
    
    Dokl. Akad. Nauk SSSR, 173:6 (1967),  1245–1246
33. An estimate of the external stability number of a graph
    
    Dokl. Akad. Nauk SSSR, 164:4 (1965),  729–731
34. On the problem of the minimal coloring of the vertices of a graph
    
    Sibirsk. Mat. Zh., 6:1 (1965),  234–236
35. Flows of equal magnitude across a transportation network
    
    Dokl. Akad. Nauk SSSR, 144:6 (1962),  1209–1211