Belaineh, Zelealem(PhD)Mohammed, Seid2018-07-172023-11-042018-07-172023-11-042014-02-17http://etd.aau.edu.et/handle/123456789/8906This paper presents every K4-free graph G with n vertices can be made bipartite by deleting at most n2 9 edges. Moreover, the only extremal graph which requires deletion of that many edges is a complete 3-partite graph with parts of size n=3enMaking A K4-Free Graph BipartiteThesis