We prove that the product version of the 1-2-3 Conjecture, raised by
Sko...
An injective k-edge-coloring of a graph G is an assignment of colors,
i....
In a proper edge-coloring the edges of every color form a matching. A
ma...
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...
We study the complexity of graph modification problems for homomorphism-...
The graph coloring game is a two-player game in which, given a graph G a...