An (n,m)-graph has n different types of arcs and m different types of
ed...
The chromatic number, which refers to the minimum number of colours requ...
We prove that the product version of the 1-2-3 Conjecture, raised by
Sko...
An independent broadcast on a graph G is a function f: V ⟶{0,…, diam(G)}...
Modular Decomposition focuses on repeatedly identifying a module M (a
co...
A signed graph (G, σ) is a graph G along with a function σ:
E(G) →{+,-}....
We study the exact square chromatic number of subcubic planar graphs. An...
The product version of the 1-2-3 Conjecture, introduced by
Skowronek-Kaz...
Pushable homomorphisms and the pushable chromatic number χ_p of oriented...
A distinguishing r-vertex-labelling (resp. r-edge-labelling) of an undir...
In this note, we introduce and study a new version of
neighbour-distingu...
The graph coloring game is a two-player game in which, given a graph G a...
A broadcast on a graph G=(V,E) is a function f: V⟶{0,...,diam(G)} such t...
Total coloring is a variant of edge coloring where both vertices and edg...
Let G be a simple undirected graph.A broadcast on G isa function f :
V(G...
We show that any orientation of a graph with maximum degree three has an...
The packing chromatic number χ ρ (G) of a graph G is the smallest
intege...