A Novel Method of Proving Konig Theorem in the Matching Theory
Yang Peng-fei · 2003
This paper sums up some methods and ideas of proving Konig theorem in matching theory of the graph theory. Furthermore, a new method of proving Konig theorem is proposed by finding out maximum matching from minimum vertex-covering. This new method, which reflects the essence of the theorem from another point of view, is an effective complement of the forenamed methods.