Uniqueness and Complexity in Generalised Colouring
MetadataShow full item record
The study and recognition of graph families (or graph properties) is an essential part of combinatorics. Graph colouring is another fundamental concept of graph theory that can be looked at, in large part, as the recognition of a family of graphs that are colourable according to certain rules. In this thesis, we study additive induced-hereditary families, and some generalisations, from a colouring perspective. Our main results are: · Additive induced-hereditary families are uniquely factorisable into irreducible families. · If <i>P</i> and <i>Q</i> are additive induced-hereditary graph families, then (<i>P</i>,<i>Q</i>)-COLOURING is NP-hard, with the exception of GRAPH 2-COLOURING. Moreover, with the same exception, (<i>P</i>,<i>Q</i>)-COLOURING is NP-complete iff <i>P</i>- and <i>Q</i>-RECOGNITION are both in NP. This proves a 1997 conjecture of Kratochvíl and Schiermeyer. We also provide generalisations to somewhat larger families. Other results that we prove include: · a characterisation of the minimal forbidden subgraphs of a hereditary property in terms of its minimal forbidden induced-subgraphs, and <i>vice versa</i>; · extensions of Mihók's construction of uniquely colourable graphs, and Scheinerman's characterisations of compositivity, to disjoint compositive properties; · an induced-hereditary property has at least two factorisations into arbitrary irreducible properties, with an explicitly described set of exceptions; · if <i>G</i> is a generating set for <i>A</i> ο <i>B</i>, where <i>A</i> and <i>B</i> are indiscompositive, then we can extract generating sets for <i>A</i> and <i>B</i> using a <i>greedy algorithm</i>.
Cite this work
Alastair Farrugia (2003). Uniqueness and Complexity in Generalised Colouring. UWSpace. http://hdl.handle.net/10012/1018
Showing items related by title, author, creator and subject.
Jampani, Krishnam Raju (University of Waterloo, 2011-02-18)Many graphs arising in practice can be represented in a concise and intuitive way that conveys their structure. For example: A planar graph can be represented in the plane with points for vertices and non-crossing curves ...
Sartipi, Kamran (University of Waterloo, 2003)Pattern matching approaches in reverse engineering aim to incorporate domain knowledge and system documentation in the software architecture extraction process, hence provide a user/tool collaborative environment for ...
From Isomorphism-Based Security for Graphs to Semantics-Preserving Security for the Resource Description Framework (RDF) Lin, Zhiyuan (University of Waterloo, 2016-08-17)Resource Description Framework (RDF) is a graph-like data model designed for the web. One of its compelling features is a precise, model-theoretic semantics. We address security in the context of the RDF. We first observe ...