Use this URL to cite or link to this record in EThOS:
Title: Well-quasi-ordering of combinatorial structures
Author: Atminas, Aistis
ISNI:       0000 0004 5350 1976
Awarding Body: University of Warwick
Current Institution: University of Warwick
Date of Award: 2015
Availability of Full Text:
Access from EThOS:
Access from Institution:
In this work we study the notion of well-quasi-ordering for various partial orders and its relation to some other notions, such as clique-width. In particular, we prove decidability of well-quasi-ordering for factorial languages, subquadratic properties of graphs and classes of graphs with finite distinguishing number. In addition, we reveal some new classes of graphs and permutations which are or are not well-quasi-ordered. We also prove that subquadratic properties or classes of graphs with finite distinguishing number that are well-quasi-ordered have bounded clique-width and we identify two new minimal classes of graphs of unbounded clique-width.
Supervisor: Not available Sponsor: Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick ; Engineering and Physical Sciences Research Council (EPSRC) (EP/D063191/1)
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: QA Mathematics