Use this URL to cite or link to this record in EThOS:
Title: On hereditary graph classes defined by forbidding Truemper configurations : recognition and combinatorial optimization algorithms, and χ-boundedness results
Author: Boncompagni, Valerio
ISNI:       0000 0004 7660 963X
Awarding Body: University of Leeds
Current Institution: University of Leeds
Date of Award: 2018
Availability of Full Text:
Access from EThOS:
Access from Institution:
Truemper configurations are four types of graphs that helped us understand the structure of several well-known hereditary graph classes. The most famous examples are perhaps the class of perfect graphs and the class of even-hole-free graphs: for both of them, some Truemper configurations are excluded (as induced subgraphs), and this fact appeared to be useful, and played some role in the proof of the known decomposition theorems for these classes. The main goal of this thesis is to contribute to the systematic exploration of hereditary graph classes defined by forbidding Truemper configurations. We study many of these classes, and we investigate their structure by applying the decomposition method. We then use our structural results to analyze the complexity of the maximum clique, maximum stable set and optimal coloring problems restricted to these classes. Finally, we provide polynomial-time recognition algorithms for all of these classes, and we obtain χ-boundedness results.
Supervisor: Vuskovic, Kristina ; Dyer, Martin Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available