Making A K4-free Graph Bipartite

This paper presents every K4-free graph G with n vertices can be madernbipartite by deleting at most n2rn9 edges. Moreover, the only extremal graphrnwhich requires deletion of that many edges is a complete 3-partite graph withrnparts of size n=3

Get Full Work

Report copyright infringement or plagiarism