Davide Mattiolo

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Edge-connectivity and pairwise disjoint perfect matchings in regular graphs
Combinatorica
2024-05-31Paper
On \(d\)-dimensional nowhere-zero \(r\)-flows on a graph
European Journal of Mathematics
2023-11-08Paper
Edge colorings and circular flows on regular graphs
Journal of Graph Theory
2023-10-05Paper
Highly edge‐connected regular graphs without large factorizable subgraphs
Journal of Graph Theory
2023-10-04Paper
A unified approach to construct snarks with circular flow number 5
Journal of Graph Theory
2023-09-29Paper
A unified approach to construct snarks with circular flow number 5
Journal of Graph Theory
2023-09-29Paper
Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs
SIAM Journal on Discrete Mathematics
2023-08-10Paper
Sets of $r$-graphs that color all $r$-graphs2023-05-15Paper
A lower bound for the complex flow number of a graph: a geometric approach2023-03-17Paper
A characterization of graphs with small palette index2022-12-20Paper
Graphs with large palette index
Discrete Mathematics
2022-03-14Paper
On sublinear approximations for the Petersen coloring conjecture2021-09-13Paper
On sublinear approximations for the Petersen coloring conjecture
(available as arXiv preprint)
2021-09-13Paper
On 3-bisections in cubic and subcubic graphs
Graphs and Combinatorics
2021-08-12Paper
On \(\mathbb{Z}\)-flow-continuous maps and oriented colorings of cubic graphs2021-05-28Paper
Computational results and new bounds for the circular flow number of snarks
Discrete Mathematics
2020-08-12Paper
Computational results and new bounds for the circular flow number of snarks
Discrete Mathematics
2020-08-12Paper
Edge-connectivity and pairwise disjoint perfect matchings in regular graphs
(available as arXiv preprint)
N/APaper
A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs
(available as arXiv preprint)
N/APaper
Non-double covered cubic graphs
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Davide Mattiolo