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