摘要
经典的Ｖｉｚｉｎｇ边染色定理断言：对于任何一个重数为μ且最大度为Δ的重图Ｇ，只须用μ＋Δ种颜色就可以将Ｇ中的边进行染色，使得相邻边的颜色不同．
The classical Vizing's edge colouring theorem states that for a loopless multigraph G of multiplicity μ and of maximum degree Δ, Δ+μ colours suffice to colour the edges of G such that adjacent edges have got different colours. A very short proof of the theorem is presented.
基金
国家自然科学基金
关键词
重图
边染色
Vizing定理
染色
multigraphs, edge colourings, vizing's theorem AMS Classification(1991) 05C15
