Indonesian Journal of CombinatoricsVol 1, No 2 (2017)
New proofs of Konig's bipartite graph characterization theorem
Salman Ghazal(Faculty of Science, Department of Mathematics, Lebanese University)
Article Info
Publish Date 23 Aug 2017
Abstract
We introduce four new elementary short proofs of the famous K\"{o}nig's theorem which characterizes bipartite graphs by absence of odd cycles. Our proofs are more elementary than earlier proofs because they use neither distances nor walks nor spanning trees.
Indonesian Journal of Combinatorics (IJC) publishes current research articles in any area of combinatorics and graph theory such as graph labelings, optimal network problems, metric dimension, graph coloring, rainbow connection and other related topics.
IJC is published by the Indonesian ...