Skip to search formSkip to main contentSkip to account menu

Vadim G. Vizing

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

Related topics

Related topics

8 relations
Brooks' theoremEdge coloringGraph theoryList coloring

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Fractional matchings and component-factors of (edge-chromatic critical) graphs
The paper studies component-factors of graphs which can be characterized in terms of their fractional matching number. These… 
2018
2018
Some bound of the edge chromatic surplus of certain cubic graphs
V.G. Vizing showed that any graph belongs to one of two classes: Class 1 if χ ʹ( G ) = Δ( G ) or in class 2 if χ ʹ( G ) = Δ( G… 
2013
2013
Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable
We consider the problem of list edge coloring for planar graphs. Edge coloring is the problem of coloring the edges while… 
Review
2009
Review
2009
Michael Albertson died in March after a short , intense battle with a rare form of thyroid cancer
Michael Albertson died in March after a short, intense battle with a rare form of thyroid cancer. He was a mathematician fully… 
2008
2008
Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms
Brooks proved that every connected graph other than a clique or odd cycle can be colored with $\Delta$ colors. Erdos, Rubin, and… 
2007
2007
A Unified Spiral Chain Coloring Algorithm for Planar Graphs
In this paper we have given a unified graph coloring algorithm for planar graphs. The problems that have been considered in this… 
Review
2002
Review
2002
Strategies for multigraph edge coloring
n mathematical graph theory, coloring problems are ubiquitous. Dating back to the famous four-color map problem, both the theory… 
2002
2002
THE CHROMATIC N UMBER OF GRAPHS WHICH INDUCE NEITHER K~,3 NOR K s - e
For a graph H with maximal degree A(H) Vizing's Theorem tells us that the chromatic index x ' (H) satisfies A(H) <~ x ' (H) ~< A… 
1999
1999
Asymptotics of the total chromatic number for multigraphs
For loopless multigraphs, the total chromatic number is asymptotically its fractional counterpart as the latter invariant tends… 
1997
1997
On generalized list colourings of graphs
Vizing [15] and Erdös et al. [8] independently introduce the idea of considering list-colouring and k-choosability. In the both…