Vadim G. Vizing

Known as: Vadim Vizing, Vizing

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

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…

2018

In this paper, we show that every $(2P_2,K_4)$-free graph is 4-colorable. The bound is attained by the five-wheel and the…

2012

In this paper, we prove that every planar graph of maximum degree six without 7-cycles is class one.

2011

A dominating set $D$ for a graph $G$ is a subset of $V(G)$ such that any vertex not in $D$ has at least one neighbor in $D$. The…

2010

In this note, we provide a short proof of a recent result on a Vizing-like problem for integer total domination in graphs given…

2008

Brooks proved that every connected graph other than a clique or odd cycle can be colored with $\Delta$ colors. Erdos, Rubin, and…

2006

We introduce a unifying framework for studying edge‐coloring problems on multigraphs. This is defined in terms of a rooted…

Review

2002

Review

2002

n mathematical graph theory, coloring problems are ubiquitous. Dating back to the famous four-color map problem, both the theory…

1997

Vizing [15] and Erdös et al. [8] independently introduce the idea of considering list-colouring and k-choosability. In the both…

1986

If δ and ∆ are the minimum and maximum degrees of a simple graph G of size n, then, for its domination number B(G), we show that…