Davide Mattiolo

activity

20192026

collaborators

5 papers

math.CO2026

Cyclically $5$ -edge-connected snarks with resistance $2$ and flow resistance $n$

Davide Mattiolo, Pietro Negrini, Silvia M. C. Pagani

Snarks are $2$ -connected cubic graphs that do not admit a proper $3$ -edge-coloring. For a cubic graph $G$ , its resistance $r (G)$ is the minimum number of edges whose removal result…

math.CO2023

Sets of $r$ -graphs that color all $r$ -graphs

Yulai Ma, Davide Mattiolo, Eckhard Steffen +1

An $r$ -regular graph is an $r$ -graph, if every odd set of vertices is connected to its complement by at least $r$ edges. Let $G$ and $H$ be $r$ -graphs. An $H$ -coloring of $G$ is a…

math.CO2022

Edge-connectivity and pairwise disjoint perfect matchings in regular graphs

Yulai Ma, Davide Mattiolo, Eckhard Steffen +1

For $0 \leq t \leq r$ let $m (t, r)$ be the maximum number $s$ such that every $t$ -edge-connected $r$ -graph has $s$ pairwise disjoint perfect matchings. There are only a few values o…

math.CO2020

Edge colorings and circular flows on regular graphs

Davide Mattiolo, Eckhard Steffen

Let $ϕ_{c} (G)$ be the circular flow number of a bridgeless graph $G$ . In [Edge-colorings and circular flow numbers of regular graphs, J. Graph Theory 79 (2015) 1-7] it was proved tha…

math.CO2019

Highly edge-connected regular graphs without large factorizable subgraphs