𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An extension of Vizing's theorem

✍ Scribed by Chew, K. H.


Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
110 KB
Volume
24
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis


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 the same colour. In particular, if


πŸ“œ SIMILAR VOLUMES


A short proof for a generalization of Vi
✍ 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

Edge list multicoloring trees: An extens
✍ Mathew Cropper; AndrΓ‘s GyΓ‘rfΓ‘s; JenΕ‘ Lehel πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 99 KB

## Abstract We prove a necessary and sufficient condition for the existence of edge list multicoloring of trees. The result extends the Halmos–Vaughan generalization of Hall's theorem on the existence of distinct representatives of sets. Β© 2003 Wiley Periodicals, Inc. J Graph Theory 42: 246–255, 20

Extension of Toyoda's theorem on entropi
✍ Vladimir Volenec πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 281 KB

## Extension of Toyoda's theorem on entropic groupoids By VLADIMRC VOLENEC of Zagreb (Eingegangen am 8. 10. 1980) A groupoid (a, .) is said to be entropic iff for every a, b, c, d E G the equality (1) ab cd = acbd holds true. A well-known TOYODA'S theorem ([S], [a], [21 and [l], 1). 33) asserts th