V. G. Vizing

689 total citations
15 papers, 438 citations indexed

About

V. G. Vizing is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Industrial and Manufacturing Engineering. According to data from OpenAlex, V. G. Vizing has authored 15 papers receiving a total of 438 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Computational Theory and Mathematics, 6 papers in Electrical and Electronic Engineering and 4 papers in Industrial and Manufacturing Engineering. Recurrent topics in V. G. Vizing's work include Graph Labeling and Dimension Problems (8 papers), graph theory and CDMA systems (6 papers) and Advanced Graph Theory Research (5 papers). V. G. Vizing is often cited by papers focused on Graph Labeling and Dimension Problems (8 papers), graph theory and CDMA systems (6 papers) and Advanced Graph Theory Research (5 papers). V. G. Vizing collaborates with scholars based in Ukraine and Russia. V. G. Vizing's co-authors include A. V. Pyatkin and Mark Goldberg and has published in prestigious journals such as Russian Mathematical Surveys, Journal of Graph Theory and Cybernetics and Systems Analysis.

In The Last Decade

V. G. Vizing

11 papers receiving 408 citations

Peers

V. G. Vizing

CTM

DMC

GT

EEE

CNC

Stanley Fiorini United Kingdom

Ko‐Wei Lih Taiwan

Sulamita Klein Brazil

Gabriel Semanišin Slovakia

Bert L. Hartnell Canada

Kathie Cameron Canada

Bernard Lidický United States

Mekkia Kouider France

Ross J. Kang Netherlands

V. E. Alekseev Russia

Stanley Fiorini United Kingdom

V. G. Vizing

280 ×0.7

CTM

125 ×0.6

DMC

131 ×1.4

GT

77 ×0.8

EEE

31 ×1.1

CNC

Citations per year, relative to V. G. Vizing V. G. Vizing (= 1×) peers Stanley Fiorini

Countries citing papers authored by V. G. Vizing

Since Specialization

Citations

This map shows the geographic impact of V. G. Vizing's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by V. G. Vizing with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites V. G. Vizing more than expected).

Fields of papers citing papers by V. G. Vizing

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by V. G. Vizing. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by V. G. Vizing. The network helps show where V. G. Vizing may publish in the future.

Co-authorship network of co-authors of V. G. Vizing

This figure shows the co-authorship network connecting the top 25 collaborators of V. G. Vizing. A scholar is included among the top collaborators of V. G. Vizing based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with V. G. Vizing. V. G. Vizing is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

15 of 15 papers shown

1.

Vizing, V. G.. (2012). Multicriteria graph problems with the MAXMIN criterion. Journal of Applied and Industrial Mathematics. 6(2). 256–260. 1 indexed citations

2.

Vizing, V. G.. (2012). Multicoloring the incidentors of a weighted undirected multigraph. Journal of Applied and Industrial Mathematics. 6(4). 514–521.

3.

Vizing, V. G.. (2010). Coloring the vertices of a graph with majority restrictions on colors. Journal of Applied and Industrial Mathematics. 4(2). 270–275.

4.

Vizing, V. G.. (2009). On incidentor coloring in a partially directed multigraph. Journal of Applied and Industrial Mathematics. 3(2). 297–300. 1 indexed citations

5.

Vizing, V. G. & A. V. Pyatkin. (2008). Bounds for the incidentor chromatic number of a weighted undirected multigraph. Journal of Applied and Industrial Mathematics. 2(3). 432–439. 1 indexed citations

6.

Vizing, V. G.. (2007). On bounds for the incidentor chromatic number of a directed weighted multigraph. Journal of Applied and Industrial Mathematics. 1(4). 504–508. 2 indexed citations

7.

Vizing, V. G., et al.. (1999). The edge chromatic number of a directed/mixed multigraph. Journal of Graph Theory. 31(4). 267–273. 17 indexed citations

8.

Vizing, V. G., et al.. (1982). An algorithm for selecting the execution intensity of jobs in a schedule. Cybernetics and Systems Analysis. 17(5). 646–649. 1 indexed citations

9.

Vizing, V. G.. (1982). Minimization of the maximum delay in servicing systems with interruption. USSR Computational Mathematics and Mathematical Physics. 22(3). 227–233. 4 indexed citations

10.

Vizing, V. G.. (1977). Complexity of the traveling-salesman problem in the class of monotonic improvement algorithms. Cybernetics. 13(4). 623–626. 2 indexed citations

11.

Vizing, V. G.. (1975). Values of the target functional in order-of-priority problems, majorized by the mean value. Cybernetics and Systems Analysis. 9(5). 809–812. 1 indexed citations

12.

Vizing, V. G. & Mark Goldberg. (1972). The length of a circuit in a strongly connected graph. Cybernetics and Systems Analysis. 5(1-2). 95–98.

13.

Vizing, V. G., et al.. (1969). New proof of brooks' theorem. Journal of Combinatorial Theory. 7(4). 289–290. 7 indexed citations

14.

Vizing, V. G.. (1968). SOME UNSOLVED PROBLEMS IN GRAPH THEORY. Russian Mathematical Surveys. 23(6). 125–141. 293 indexed citations

15.

Vizing, V. G.. (1965). The chromatic class of a multigraph. Cybernetics and Systems Analysis. 1(3). 32–41. 108 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact