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