research
∙
06/09/2023
A dichotomy theorem for Γ-switchable H-colouring on m-edge coloured graphs
Let G be a graph in which each edge is assigned one of the colours 1, 2,...
share
research
∙
04/24/2023
Fractional eternal domination: securely distributing resources across a network
This paper initiates the study of fractional eternal domination in graph...
research
∙
08/23/2022
Homomorphically Full Oriented Graphs
Homomorphically full graphs are those for which every homomorphic image ...
research
∙
10/19/2021
Eternal Domination and Clique Covering
We study the relationship between the eternal domination number of a gra...
research
∙
10/18/2020
Colourings of (m, n)-coloured mixed graphs
A mixed graph is, informally, an object obtained from a simple undirecte...
research
∙
12/13/2018
Oriented Colourings of Graphs with Maximum Degree Three and Four
We show that any orientation of a graph with maximum degree three has an...
research
∙
10/24/2017
