Vadim G. Vizing

Known as: Vadim Vizing, Vizing 
Vadim Georgievich Vizing (Russian: Вади́м Гео́ргиевич Визинг, Ukrainian: Вадим Георгійович Візінг; born 1937) is a Ukrainian (former Soviet… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2017
051019772017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We extend the definition of the Cartesian product to graphs with loops and show that the Sabidussi–Vizing unique factorization… (More)
  • figure 1
Is this relevant?
2010
2010
The domination game played on a graph G consists of two players, Dominator and Staller who alternate taking turns choosing a… (More)
Is this relevant?
2004
2004
In this paper we investigate chromatic aspects for graphs with forbidden induced subgraphs with emphasis on the question of 3… (More)
Is this relevant?
1996
1996
One of the basic results in graph colouring is Brooks' theorem [-4] which asserts that the chromatic number of every connected… (More)
Is this relevant?
1996
1996
DISCRETE MATHEMATICS Discrete Mathematics 152 (1996) 299-302 Communication A Rajos-like theorem for list coloring Sylvain Gravier… (More)
  • figure 1
Is this relevant?
Highly Cited
1992
Highly Cited
1992
We consider finite graphs with no self-loops and no multiple edges. A graph is valid if all edges incident on a vertex have… (More)
Is this relevant?
1988
1988
I wrote many papers with this and similar titles . In my lecture I stated several of my old solved and unsolved problems some of… (More)
Is this relevant?
1983
1983
By Vizing’s theorem, the chromatic index x’(G) of a simple graph G satisfies d(G) <x’(G) <d(G) + 1; if x’(G) = d(G), then G is… (More)
Is this relevant?
Highly Cited
1981
Highly Cited
1981
We show that it is NP-complete to determine the chromatic index of an arbitrary graph. The problem remains NP-complete even for… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1977
1977
A total coloring of a multigraph G is a coloring of its edges and vertices such that: (i) no two adjacent vertices or edges have… (More)
Is this relevant?