Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Vizing, Vadim Georgievich
Statistics Math-Net.Ru
Total publications: 35
Scientific articles: 35

Number of views:
This page:4530
Abstract pages:14873
Full texts:5920
References:962

https://www.mathnet.ru/eng/person26464
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/216212

Publications in Math-Net.Ru Citations
2015
1. V. G. Vizing, “On coloring problems for the two-season multigraphs”, Diskretn. Anal. Issled. Oper., 22:2 (2015),  17–26  mathnet  mathscinet  elib; J. Appl. Industr. Math., 9:2 (2015), 292–296 1
2014
2. V. G. Vizing, “On multicoloring of incidentors of a weighted oriented multigraph”, Diskretn. Anal. Issled. Oper., 21:4 (2014),  33–41  mathnet  mathscinet; J. Appl. Industr. Math., 8:4 (2014), 604–608
2013
3. V. G. Vizing, “Half-chromatic number of graph”, Diskretn. Anal. Issled. Oper., 20:1 (2013),  3–11  mathnet  mathscinet; J. Appl. Industr. Math., 7:2 (2013), 269–274
2012
4. V. G. Vizing, “Multicoloring of incidentors of weighted undirected multigraph”, Diskretn. Anal. Issled. Oper., 19:4 (2012),  35–47  mathnet  mathscinet; J. Appl. Industr. Math., 6:4 (2012), 514–521 2
2011
5. V. G. Vizing, “Multicriterial graph problems with MAXMIN criterion”, Diskretn. Anal. Issled. Oper., 18:5 (2011),  3–10  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 6:2 (2012), 256–260  scopus 1
2009
6. V. G. Vizing, “On one twocriterial graph problem”, Diskretn. Anal. Issled. Oper., 16:5 (2009),  34–40  mathnet  mathscinet  zmath 1
7. V. G. Vizing, “Vertex colorings of graph with the majority restrictions on the consuming colors”, Diskretn. Anal. Issled. Oper., 16:4 (2009),  21–30  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 4:2 (2010), 270–275  scopus
2008
8. V. G. Vizing, “О раскраске инциденторов в частично ориентированном мультиграфе”, Diskretn. Anal. Issled. Oper., 15:1 (2008),  17–22  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 3:2 (2009), 297–300  scopus 2
2007
9. V. G. Vizing, “О мультираскраске вершин взвешенных графов”, Diskretn. Anal. Issled. Oper., Ser. 1, 14:4 (2007),  16–26  mathnet  zmath  elib 2
10. V. G. Vizing, “О раскраске инциденторов в гиперграфе”, Diskretn. Anal. Issled. Oper., Ser. 1, 14:3 (2007),  40–45  mathnet  mathscinet  zmath  elib; J. Appl. Industr. Math., 3:1 (2009), 144–147  scopus 1
11. V. G. Vizing, A. V. Pyatkin, “Об оценках инциденторного хроматического числа взвешенного неориентированного мультиграфа”, Diskretn. Anal. Issled. Oper., Ser. 1, 14:2 (2007),  3–15  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 2:3 (2008), 432–439  scopus 1
2006
12. V. G. Vizing, “On bounds for the incidentor chromatic number of a directed weighted multigraph”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:4 (2006),  18–25  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 1:4 (2007), 504–508  scopus 3
13. V. G. Vizing, A. V. Pyatkin, “On the coloring of incidentors in an oriented weighted multigraph”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:1 (2006),  33–44  mathnet  mathscinet  zmath 4
2005
14. V. G. Vizing, “On the $(p,q)$-coloring of incidentors of an undirected multigraph”, Diskretn. Anal. Issled. Oper., Ser. 1, 12:4 (2005),  23–39  mathnet  mathscinet  zmath 2
15. V. G. Vizing, “Strict coloring of incidentors in undirected multigraphs”, Diskretn. Anal. Issled. Oper., Ser. 1, 12:3 (2005),  48–53  mathnet  mathscinet  zmath 4
2004
16. V. G. Vizing, “Factor coloring of multigraph edges”, Diskretn. Anal. Issled. Oper., Ser. 1, 11:2 (2004),  18–31  mathnet  mathscinet  zmath 1
2003
17. V. G. Vizing, “On linear factors of multigraphs”, Diskretn. Anal. Issled. Oper., Ser. 1, 10:4 (2003),  3–7  mathnet  mathscinet  zmath 2
18. V. G. Vizing, “Interval colorings of the incidentors of an undirected multigraph”, Diskretn. Anal. Issled. Oper., Ser. 1, 10:1 (2003),  14–40  mathnet  mathscinet  zmath 2
2002
19. V. G. Vizing, “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  mathnet  mathscinet 15
2001
20. V. G. Vizing, B. Toft, “The coloring of the incidentors and vertices of an undirected multigraph”, Diskretn. Anal. Issled. Oper., Ser. 1, 8:3 (2001),  3–14  mathnet  mathscinet  zmath 12
21. V. G. Vizing, “Interval coloring of the incidentors of a directed multigraph”, Diskretn. Anal. Issled. Oper., Ser. 1, 8:2 (2001),  40–51  mathnet  mathscinet  zmath 4
2000
22. V. G. Vizing, L. S. Mel'nikov, A. V. Pyatkin, “On the $(k,l)$-coloring of incidentors”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:4 (2000),  29–37  mathnet  mathscinet  zmath 11
23. V. G. Vizing, “The coloring of the incidentors and vertices of a directed multigraph”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:3 (2000),  6–16  mathnet  mathscinet  zmath 7
24. V. G. Vizing, “The coloring of the incidentors of a multigraph into prescribed colors”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:1 (2000),  32–39  mathnet  mathscinet  zmath 4
1999
25. V. G. Vizing, “On the connected coloring of graphs in prescribed colors”, Diskretn. Anal. Issled. Oper., Ser. 1, 6:4 (1999),  36–43  mathnet  mathscinet  zmath 2
1995
26. V. G. Vizing, “Distributive coloring of graph vertices”, Diskretn. Anal. Issled. Oper., 2:4 (1995),  3–12  mathnet  mathscinet  zmath 10
1985
27. V. G. Vizing, “Schedules that ensure the most uniform machine loading”, Dokl. Akad. Nauk SSSR, 280:3 (1985),  525–528  mathnet  mathscinet  zmath
1982
28. V. G. Vizing, “The intensification problem for deterministic maintenance systems”, Dokl. Akad. Nauk SSSR, 267:1 (1982),  27–30  mathnet  zmath
29. V. G. Vizing, “Minimization of the maximum delay in servicing systems with interruption”, Zh. Vychisl. Mat. Mat. Fiz., 22:3 (1982),  717–722  mathnet  zmath; U.S.S.R. Comput. Math. Math. Phys., 22:3 (1982), 227–233 7
1970
30. V. G. Vizing, “О минимальной связности графов с транзитивной группой автоморфизмов”, Upravliaemie systemy, 1970, no. 7,  46–50  mathnet
1968
31. V. G. Vizing, “Some unsolved problems in graph theory”, Uspekhi Mat. Nauk, 23:6(144) (1968),  117–134  mathnet  mathscinet  zmath; Russian Math. Surveys, 23:6 (1968), 125–141 112
1967
32. V. G. Vizing, “On the number of edges in a graph with a given radius”, Dokl. Akad. Nauk SSSR, 173:6 (1967),  1245–1246  mathnet  mathscinet  zmath 1
1965
33. V. G. Vizing, “An estimate of the external stability number of a graph”, Dokl. Akad. Nauk SSSR, 164:4 (1965),  729–731  mathnet  mathscinet  zmath 1
34. V. G. Vizing, G. S. Plesnevitch, “On the problem of the minimal coloring of the vertices of a graph”, Sibirsk. Mat. Zh., 6:1 (1965),  234–236  mathnet  mathscinet  zmath 2
1962
35. V. G. Vizing, “Flows of equal magnitude across a transportation network”, Dokl. Akad. Nauk SSSR, 144:6 (1962),  1209–1211  mathnet

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024