๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A generalization of Vizing's theorem on domination

โœ Scribed by Jason Fulman

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
205 KB
Volume
126
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A short proof for a generalization of Vi
A short proof for a generalization of Vizing's theorem
โœ Claude Berge; Jean Claude Fournier ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 183 KB ๐Ÿ‘ 1 views

## Abstract For a simple graph of maximum degree ฮ”, it is always possible to color the edges with ฮ” + 1 colors (Vizing); furthermore, if the set of vertices of maximum degree is independent, ฮ” colors suffice (Fournier). In this article, we give a short constructive proof of an extension of these re

An extension of Vizing's theorem
An extension of Vizing's theorem
โœ Chew, K. H. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 110 KB

Let G = (V (G), E(G)) be a simple graph of maximum degree โˆ† โ‰ค D such that the graph induced by vertices of degree D is either a null graph or is empty. We give an upper bound on the number of colours needed to colour a subset S of V (G) โˆช E(G) such that no adjacent or incident elements of S receive

On a generalization of Rubin's theorem
On a generalization of Rubin's theorem
โœ Dmitry A. Shabanov ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 89 KB

The work is devoted to the calculation of asymptotic value of the choice number of the complete r-partite graph K m \* r = K m,. ..,m with equal part size m. We obtained the asymptotics in the case ln r = o(ln m). The proof generalizes the classical result of A.L. Rubin for the case r = 2.