On hereditary graph classes defined by forbidding Truemper configurations: recognition and combinatorial optimization algorithms, and χ-boundedness results

Boncompagni, Valerio (2018) On hereditary graph classes defined by forbidding Truemper configurations: recognition and combinatorial optimization algorithms, and χ-boundedness results. PhD thesis, University of Leeds.

Abstract

Metadata

Supervisors: Vuskovic, Kristina and Dyer, Martin
Keywords: structural graph theory, graph algorithms, combinatorial optimization
Awarding institution: University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)
Identification Number/EthosID: uk.bl.ethos.770096
Depositing User: Valerio Boncompagni
Date Deposited: 01 Apr 2019 08:47
Last Modified: 18 Feb 2020 12:49

Download

Final eThesis - complete (pdf)

Export

Statistics


You do not need to contact us to get a copy of this thesis. Please use the 'Download' link(s) above to get a copy.
You can contact us about this thesis. If you need to make a general enquiry, please see the Contact us page.