Show simple item record

dc.contributor.authorAlex, James
dc.contributor.supervisorGuanglu Zhouen_US
dc.contributor.supervisorLouis Caccettaen_US
dc.date.accessioned2025-07-11T06:14:30Z
dc.date.available2025-07-11T06:14:30Z
dc.date.issued2025en_US
dc.identifier.urihttp://hdl.handle.net/20.500.11937/98074
dc.description.abstract

This thesis investigates perfect graphs and its extensions, focusing on induced and non-induced star-perfect graphs, as well as strongly-perfect graphs. It presents an alternative proof to Lovász's characterization (1972) and characterizes induced star-perfect graphs in terms of minimal forbidden induced subgraphs. The thesis also identifies classes of non-induced star-perfect graphs and formulates its invariants using integer-programming. Additionally, a new list of sp-critical graphs and a sufficient condition for a graph to be strongly-perfect is presented.

en_US
dc.publisherCurtin Universityen_US
dc.titlePerfect Graphs and its Extensionsen_US
dc.typeThesisen_US
dcterms.educationLevelPhDen_US
curtin.departmentSchool of Electrical Engineering, Computing and Mathematical Sciencesen_US
curtin.accessStatusFulltext not availableen_US
curtin.facultyScience and Engineeringen_US
curtin.contributor.orcidAlex, James [0000-0001-5431-8020]en_US
dc.date.embargoEnd2027-06-30


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record