5 citations · 9 across the 4 of their papers we have counts for
5 papers · 1 filter
Orthogonal Colourings of Random Geometric Graphs
Jeannette Janssen, Kyle MacKeigan
In this paper, we study orthogonal colourings of random geometric graphs. Two colourings of a graph are orthogonal if they have the property that when two vertices receive the same…
Existence of Optimally-Greatest Digraphs for Strongly Connected Node Reliability
Danielle Cox, Kyle MacKeigan, Emily Wright
In this paper, we introduce a new model to study network reliability with node failures. This model, strongly connected node reliability, is the directed variant of node reliabilit…
Orthogonal Colourings of Tensor Graphs
Kyle MacKeigan
In this paper, perfect k-orthogonal colourings of tensor graphs are studied. First, the problem of determining if a given graph has a perfect 2-orthogonal colouring is reformulated…
Independent Coverings and Orthogonal Colourings
Kyle MacKeigan
In this paper, two open conjectures are disproved. One conjecture regards independent coverings of sparse partite graphs, whereas the other conjecture regards orthogonal colourings…
Orthogonal Colourings of Cayley Graphs
Kyle MacKeigan, Jeannette Janssen
Two colourings of a graph are orthogonal if they have the property that when two vertices are coloured with the same colour in one colouring, then those vertices receive distinct c…