Making A K4-Free Graph Bipartite

Simple item page
dc.contributor.advisorBelaineh, Zelealem(PhD)
dc.contributor.authorMohammed, Seid
dc.date.accessioned2018-07-17T07:06:34Z
dc.date.accessioned2023-11-04T12:30:38Z
dc.date.available2018-07-17T07:06:34Z
dc.date.available2023-11-04T12:30:38Z
dc.date.issued2014-02-17
dc.description.abstractThis 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=3en_US
dc.identifier.urihttp://etd.aau.edu.et/handle/123456789/8906
dc.language.isoenen_US
dc.publisherAddis Ababa Universityen_US
dc.subjectMaking A K4-Free Graph Bipartiteen_US
dc.titleMaking A K4-Free Graph Bipartiteen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Mohammed Seld.pdf
Size:
599.66 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description:
Download

Collections

Mathematics