Well-quasi-ordering of combinatorial structures
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 di...
| Main Author: | |
|---|---|
| Published: |
University of Warwick
2015
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.641019 |