Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 291 for “"colouring"”.
-
Correspondence Colouring and its Applications to List Colouring and Delay Colouring
In this thesis, we study correspondence colouring and its applications to list colouring and delay colouring. We give a detailed exposition of the paper of Dvořák, and Postle introducing correspondence colouring. Moreover, we generalize two important results in delay colouring. The first is a …
-
Colouring Subspaces
… set theory, but our main results concern colouring a graph that is intimately related to these vector space analogues. The vertices of the <em>q</em>-Kneser graph are the <em>k</em>-dimensional subspaces of a vector space of dimension <em>v</em> over F<sub><em>q</em></sub>, and two …
-
False Colouring
False Colouring is an exhibition that consists of three looping video installations, and over a thousand hand-sized, hand-printed paper dresses that were hung with clothespins to a labyrinthine configuration of white string. This installation was created as a means to externalize, reveal, and …
-
Colouring Cayley Graphs
We will discuss three ways to bound the chromatic number on a Cayley graph. 1. If the connection set contains information about a smaller graph, then these two graphs are related. Using this information, we will show that Cayley graphs cannot have chromatic number three. 2. We will prove a general …
-
Colouring the nation
<p>This thesis analyses the importance of race for the construction of nation and ethnicity in the Dominican Republic, a situation in which racial ancestry and spatial proximity to Haiti are paramount. Firstly, racial legacies are of primary importance among a Dominican population where cultural, …
-
Colouring sparse graphs
Contains fulltext : 208472.pdf (Publisher’s version ) (Open Access)
-
Aspects of graph colouring
The four-colour conjecture of 1852, and the total colouring conjecture of 1965, have sparked off many new concepts and conjectures. In this thesis we investigate many of the outstanding conjectures, establishing various related results, and present many conjectures of our own. <br></br><br></br>We …
-
Backbone Colouring of Graphs
… graph G and a subgraph of G, H. A q-backbone k-colouring of (G,H) is a mapping f: V(G) {1, 2, ..., k} such that G is properly coloured and for each edge of H, the colours of its endpoints differ by at least q. The minimum number k for which there is a backbone k-colouring of (G,H) is the …
-
Graph Colouring and Decomposition
In this thesis we consider two variants on graph colouring. The first variant, ℓ-vertex-ranking requires that the vertices in the graph are assigned integer colours such that any path of length at most ℓ has a unique maximum colour. For this problem we give asymptotically tight bounds on the number …
-
Local Perspectives on Planar Colouring
… is contained. We state and prove a local list colouring theorem unifying the two theorems of Thomassen mentioned above. In particular, we show that if G is a planar graph and L is a list assignment for G such that |L(v)| ≥ 3 for all v in V(G); |L(v)| ≥ 4 for every vertex v contained in a …
-
Overlap and fractional graph colouring
… body of material exists concerning the colouring of graphs, there is much less on overlap colourings. In this thesis, we investigate the colouring of certain families of graphs.
-
Graph colouring and other stories
… Theory. Half of these problems relate to edge-colourings of graphs; the other half are concerned with H-colourings, reconstruction, and pursuit and evasion games. <br></br> For graphs G and H, an H-colouring of G is a map ψ : V (G) → V (H) such that ij ∈ E(G) ⇒ ψ(i)ψ(j) ∈ E(H). The number of …
-
Uniqueness and Complexity in Generalised Colouring
… 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, …
-
Acyclic List Colouring Locally Planar Graphs
A (vertex) colouring of a graph is \emph{acyclic} if it contains no bicoloured cycle. In 1979, Borodin proved that planar graphs are acyclically 5-colourable. In 2010, Kawarabayashi and Mohar proved that locally planar graphs are acyclically 7-colourable. In 2002, Borodin, Fon-Der-Flaass, …
-
Acyclic Colouring of Graphs on Surfaces
An acyclic k-colouring of a graph G is a proper k-colouring of G with no bichromatic cycles. In 1979, Borodin proved that planar graphs are acyclically 5-colourable, an analog of the Four Colour Theorem. Kawarabayashi and Mohar proved in 2010 that "locally" planar graphs are acyclically …
-
Probabilistic graph colouring algorithms using Zykov trees
Let G=(V ,E) be a simple, undirected graph. A colouring of G is a mapping c : V ➔ {1,2, ... ,k}. c is a proper colouring if c(u) * c(v) for all {u,v} in E. The chromatic number of G, denoted x (G), is the smallest positive integer k for which a proper k-colouring exists. The graph colouring …
-
Configurations and colouring problems in block designs
… 3-chromatic STS(19) has an <i>equitable</i> 3-colouring (meaning that the colours are as uniformly distributed as possible), and that for all admissible v > 25 there exists a 3-chromatic STS(<i>v</i>) which does not admit an equitable 3-colouring. We obtain a formula for the number of …
-
Facial colouring body language in Jane Austen
… language (FBL) descriptions focusing on facial colouring body language (FCBL) in Jane Austen’s (JA’s) novels Pride and Prejudice, Emma, and Persuasion. The focus is on the verbal and non-verbal exchanges between three female characters and their future husbands. FBL is an important tool in …
Page 1 of 15