activity
20212025
most citedOn the existence of graphs which can colour every regular graph

3 citations · 3 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2025

Geometric description of -dimensional flows of a graph

Davide Mattiolo, Giuseppe Mazzuoccolo, Jozef Rajník +1

A -dimensional nowhere-zero -flow on a graph , an -NZF from now on, is a flow where the value on each edge is an element of whose (Euclidean) norm li…

math.CO2023

On -dimensional nowhere-zero -flows on a graph

Davide Mattiolo, Giuseppe Mazzuoccolo, Jozef Rajník +1

A -dimensional nowhere-zero -flow on a graph , an -NZF from now on, is a flow where the value on each edge is an element of whose (Euclidean) norm li…

math.CO2023

A lower bound for the complex flow number of a graph: a geometric approach

Davide Mattiolo, Giuseppe Mazzuoccolo, Jozef Rajník +1

Let be a real number. A complex nowhere-zero -flow on a graph is an orientation of together with an assignment such that, for all…

math.CO2023

A characterization of graphs with small palette index

Domenico Labbate, Davide Mattiolo, Giuseppe Mazzuoccolo +2

Given an edge-coloring of a graph , we associate to every vertex of the set of colors appearing on the edges incident with . The palette index of is defined as th…

math.CO2021★ 3 cited

On the existence of graphs which can colour every regular graph

Giuseppe Mazzuoccolo, Gloria Tabarelli, Jean Paul Zerafa

Let and be graphs. An -colouring of is a proper edge-colouring such that for any vertex there exists a vertex with $…

math.CO2021

Graphs with large palette index

Davide Mattiolo, Giuseppe Mazzuoccolo, Gloria Tabarelli

Given an edge-coloring of a graph, the palette of a vertex is defined as the set of colors of the edges which are incident with it. We define the palette index of a graph as the mi…