research
∙
04/04/2022
Homomorphisms of (n,m)-graphs with respect to generalised switch
An (n,m)-graph has n different types of arcs and m different types of ed...
share
research
∙
09/28/2021
Generalising the achromatic number to Zaslavsky's colourings of signed graphs
The chromatic number, which refers to the minimum number of colours requ...
research
∙
08/24/2021
A proof of the Multiplicative 1-2-3 Conjecture
We prove that the product version of the 1-2-3 Conjecture, raised by Sko...
research
∙
02/08/2021
On the Broadcast Independence Number of Circulant Graphs
An independent broadcast on a graph G is a function f: V ⟶{0,…, diam(G)}...
research
∙
01/21/2021
(α, β)-Modules in Graphs
Modular Decomposition focuses on repeatedly identifying a module M (a co...
research
∙
09/25/2020
On the signed chromatic number of some classes of graphs
A signed graph (G, σ) is a graph G along with a function σ: E(G) →{+,-}....
research
∙
09/02/2020
Exact square coloring of subcubic planar graphs *
We study the exact square chromatic number of subcubic planar graphs. An...
research
∙
04/20/2020
Further Evidence Towards the Multiplicative 1-2-3 Conjecture
The product version of the 1-2-3 Conjecture, introduced by Skowronek-Kaz...
research
∙
11/22/2019
Pushable chromatic number of graphs with degree constraints
Pushable homomorphisms and the pushable chromatic number χ_p of oriented...
research
∙
10/28/2019
Distinguishing numbers and distinguishing indices of oriented graphs
A distinguishing r-vertex-labelling (resp. r-edge-labelling) of an undir...
research
∙
09/23/2019
A note on the neighbour-distinguishing index of digraphs
In this note, we introduce and study a new version of neighbour-distingu...
research
∙
07/29/2019
A Connected Version of the Graph Coloring Game
The graph coloring game is a two-player game in which, given a graph G a...
research
∙
06/12/2019
Broadcasts on Paths and Cycles
A broadcast on a graph G=(V,E) is a function f: V⟶{0,...,diam(G)} such t...
research
∙
04/26/2019
Every planar graph with Δ≥ 8 is totally (Δ+2)-choosable
Total coloring is a variant of edge coloring where both vertices and edg...
research
∙
02/08/2019
On the Broadcast Independence Number of Locally Uniform 2-Lobsters
Let G be a simple undirected graph.A broadcast on G isa function f : V(G...
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
∙
08/08/2018
