Within the field of Graph Theory the many ways in which graphs can be coloured
have received a lot of attention over the years. T.R. Jensen and B. Toft provided a
summary in [8] of the most important results and research ...

The aim of this thesis is to investigate the topic of edge-colourings of graphs in the
context of hereditary graph properties. We particularly aim to investigate analogues
of reducibility, unique factorization and some ...

In this thesis we investigate generalized chromatic numbers in the context of hereditary
graph properties. We also investigate the general topic of invariants of graphs as well as
graph properties.
In Chapter 1 we give ...

In this work we will need the basic knowledge of Graph Theory as our background and as we
go along we will state and prove some of the Lattice and Set Theory results. Every graph in
this work is considered as a finite ...

The induced path number p(G) of a graph G is defined as the minimum number of subsets
into which the vertex set V(G) of G can be partitioned such that each subset induces a path.
In this thesis we determine the induced ...