default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavide Mattiolo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Yulai Ma, Davide Mattiolo, Eckhard Steffen, Isaak H. Wolf:
Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs. Comb. 44(2): 429-440 (2024)- 2023
- [j10]Yulai Ma, Davide Mattiolo, Eckhard Steffen
, Isaak H. Wolf:
Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs. SIAM J. Discret. Math. 37(3): 1548-1565 (2023) - [j9]Domenico Labbate, Davide Mattiolo, Giuseppe Mazzuoccolo, Federico Romaniello, Gloria Tabarelli:
A Characterization of Graphs with Small Palette Index. Symmetry 15(1): 154 (2023) - 2022
- [j8]Davide Mattiolo, Giuseppe Mazzuoccolo, Gloria Tabarelli:
Graphs with large palette index. Discret. Math. 345(5): 112814 (2022) - [j7]Davide Mattiolo, Eckhard Steffen:
Highly edge-connected regular graphs without large factorizable subgraphs. J. Graph Theory 99(1): 107-116 (2022) - [j6]Davide Mattiolo, Eckhard Steffen:
Edge colorings and circular flows on regular graphs. J. Graph Theory 99(3): 399-413 (2022) - 2021
- [j5]Davide Mattiolo:
On ℤ-flow-continuous maps and oriented colorings of cubic graphs. Australas. J Comb. 79: 327-339 (2021) - [j4]Davide Mattiolo, Giuseppe Mazzuoccolo, Vahan Mkrtchyan:
On sublinear approximations for the Petersen coloring conjecture. Bull. ICA 92: 78-90 (2021) - [j3]Davide Mattiolo, Giuseppe Mazzuoccolo:
On 3-Bisections in Cubic and Subcubic Graphs. Graphs Comb. 37(3): 743-746 (2021) - [j2]Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo:
A unified approach to construct snarks with circular flow number 5. J. Graph Theory 97(1): 47-69 (2021) - [i3]Davide Mattiolo, Giuseppe Mazzuoccolo, Vahan Mkrtchyan:
On sublinear approximations for the Petersen coloring conjecture. CoRR abs/2104.09241 (2021) - 2020
- [j1]Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo:
Computational results and new bounds for the circular flow number of snarks. Discret. Math. 343(10): 112026 (2020)
2010 – 2019
- 2019
- [i2]Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo:
An algorithm and new bounds for the circular flow number of snarks. CoRR abs/1909.09870 (2019) - 2018
- [i1]Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo:
A unified approach to construct snarks with circular flow number 5. CoRR abs/1804.00957 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
