Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Computing | en_US |
| dc.contributor.advisor | Cao, Yixin (COMP) | en_US |
| dc.contributor.advisor | Li, Bo (COMP) | en_US |
| dc.creator | Wang, Shenghua | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/12986 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | en_US |
| dc.rights | All rights reserved | en_US |
| dc.title | T-perfect graphs and self-complementary graphs | en_US |
| dcterms.abstract | The maximum-weight independent set problem is a fundamental NP-hard problem. To gain a deeper understanding of its complexity, identifying graph classes where the problem can be solved in polynomial time has become a popular research area. Perfect graphs have emerged as one such class, characterized by their independent set polytope being fully described by trivial and clique inequalities. Inspired by the polyhedral characterization of perfect graphs, Chv´atal introduced t-perfect graphs, where the independent set polytope is fully described by trivial, edge, and odd-cycle inequalities. This pivotal characteristic enables the development of polynomial-time algorithms to solve the maximum-weight independent set problem specifically for t-perfect graphs. Given that t-perfect graphs are defined from a polyhedral perspective, a profound understanding of their structure is essential. | en_US |
| dcterms.abstract | While a full structural characterization of the class of t-perfect graphs is still at large, substantial advancements have been made for claw-free graphs [Bruhn and Stein, Math. Program. 2012] and P5-free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]. We take one more step to characterize t-perfect graphs that are fork-free, and show that they are strongly t-perfect and three-colorable. We also present polynomial-time algorithms for recognizing and coloring these graphs. | en_US |
| dcterms.abstract | Unlike perfect graphs, t-perfect graphs are not closed under substitution or complementation. A full characterization of t-perfection with respect to substitution has been obtained by Benchetrit in his Ph.D. thesis. We attempt to understand t-perfection with respect to complementation. In particular, we show that there are only five pairs of graphs such that both the graphs and their complements are minimally t-imperfect. We also identify all t-perfect graphs that are self-complementary. | en_US |
| dcterms.abstract | We conduct a more in-depth study of self-complementary graphs. We study split graphs and pseudo-split graphs whose complements are isomorphic to themselves. These special subclasses of self-complementary graphs are actually the core of self-complementary graphs. Indeed, all realizations of forcibly self-complementary degree sequences are pseudo-split graphs. We also give formulas to calculate the number of self-complementary (pseudo-)split graphs of a given order, and show that Trotignon’s conjecture holds for all self-complementary split graphs. | en_US |
| dcterms.extent | x, 135 pages : color illustrations | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2024 | en_US |
| dcterms.educationalLevel | Ph.D. | en_US |
| dcterms.educationalLevel | All Doctorate | en_US |
| dcterms.LCSH | Perfect graphs | en_US |
| dcterms.LCSH | Graph theory | en_US |
| dcterms.LCSH | Computer science—Mathematics | en_US |
| dcterms.LCSH | Graph algorithms | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | open access | en_US |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/12986