1 citations · 1 across the 4 of their papers we have counts for
7 papers
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…
On sublinear approximations for the Petersen coloring conjecture
Davide Mattiolo, Giuseppe Mazzuoccolo, Vahan Mkrtchyan
If is a function, then let us say that is sublinear if \[\lim_{n\rightarrow +\infty}\frac{f(n)}{n}=0.\] If is a cubic graph and $…
An algorithm and new bounds for the circular flow number of snarks
Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo
It is well-known that the circular flow number of a bridgeless cubic graph can be computed in terms of certain partitions of its vertex-set with prescribed properties. In the prese…
A unified approach to construct snarks with circular flow number 5
Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo
The well-known 5-flow Conjecture of Tutte, stated originally for integer flows, claims that every bridgeless graph has circular flow number at most 5. It is a classical result that…
A family of multigraphs with large palette index
Maddalena Avesani, Arrigo Bonisoli, Giuseppe Mazzuoccolo
Given a proper edge-coloring of a loopless multigraph, the palette of a vertex is defined as the set of colors of the edges which are incident with it. The palette index of a multi…
A note on 2--bisections of claw--free cubic graphs
M. Abreu, J. Goedgebeur, D. Labbate +1
A \emph{--bisection} of a bridgeless cubic graph is a --colouring of its vertex set such that the colour classes have the same cardinality and all connected components in…