default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTommaso Traetta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Tommaso Traetta
:
A constructive solution to the Oberwolfach problem with a large cycle. Discret. Math. 347(5): 113947 (2024)- [j19]Andrea C. Burgess, Peter Danziger, Adrián Pastine, Tommaso Traetta:
Constructing uniform 2-factorizations via row-sum matrices: Solutions to the Hamilton-Waterloo problem. J. Comb. Theory A 201: 105803 (2024) - [j18]L. Mella, Tommaso Traetta:
Constructing generalized Heffter arrays via near alternating sign matrices. J. Comb. Theory, Ser. A 205: 105873 (2024) - 2023
- [j17]Simone Costa, Tommaso Traetta:
Factorizing the Rado graph and infinite complete graphs. Ars Math. Contemp. 24(1): 1 (2023) - 2022
- [j16]Andrea C. Burgess, Peter Danziger, Tommaso Traetta:
On the Oberwolfach problem for single-flip 2-factors via graceful labelings. J. Comb. Theory A 189: 105611 (2022) - 2021
- [j15]Fabio Salassa, Gabriele Dragotto, Tommaso Traetta, Marco Buratti, Federico Della Croce:
Merging combinatorial design and optimization: the Oberwolfach problem. Australas. J Comb. 79: 141-166 (2021) - [j14]Simona Bonvicini, Marco Buratti, Martino Garonzi, Gloria Rinaldi, Tommaso Traetta:
The first families of highly symmetric Kirkman Triple Systems whose orders fill a congruence class. Des. Codes Cryptogr. 89(12): 2725-2757 (2021)
2010 – 2019
- 2019
- [j13]Andrea C. Burgess, Peter Danziger, Tommaso Traetta:
On the generalized Oberwolfach problem. Ars Math. Contemp. 17(1): 67-78 (2019) - [j12]Andrea C. Burgess, Peter Danziger, Tommaso Traetta:
The Hamilton-Waterloo Problem with even cycle lengths. Discret. Math. 342(8): 2213-2222 (2019) - 2018
- [j11]Andrea C. Burgess, Peter Danziger, Tommaso Traetta:
On the Hamilton-Waterloo Problem with cycle lengths of distinct parities. Discret. Math. 341(6): 1636-1644 (2018) - 2017
- [j10]Marco Buratti, Gloria Rinaldi, Tommaso Traetta:
3-pyramidal Steiner triple systems. Ars Math. Contemp. 13(1): 95-106 (2017) - [j9]Peter Danziger, Eric Mendelsohn, Tommaso Traetta:
On the existence of unparalleled even cycle systems. Eur. J. Comb. 59: 11-22 (2017) - 2016
- [j8]Francesca Merola, Tommaso Traetta:
Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles. Discret. Math. 339(9): 2267-2283 (2016) - 2015
- [j7]Marco Buratti, Tommaso Traetta:
The Structure of 2-Pyramidal 2-Factorizations. Graphs Comb. 31(3): 523-535 (2015) - [j6]Marco Buratti, Graham J. Lovegrove, Tommaso Traetta:
On the Full Automorphism Group of a Hamiltonian Cycle System of Odd Order. Graphs Comb. 31(6): 1855-1865 (2015) - 2013
- [j5]Tommaso Traetta:
On a Class of Highly Symmetric k-Factorizations. Electron. J. Comb. 20(1): 24 (2013) - [j4]Marco Buratti, Stefano Capparelli, Francesca Merola, Gloria Rinaldi, Tommaso Traetta:
A collection of results on Hamiltonian cycle systems with a nice automorphism group. Electron. Notes Discret. Math. 40: 245-252 (2013) - [j3]Tommaso Traetta:
A complete solution to the two-table Oberwolfach problems. J. Comb. Theory A 120(5): 984-997 (2013) - 2012
- [j2]Simona Bonvicini, Marco Buratti, Gloria Rinaldi, Tommaso Traetta:
Some progress on the existence of 1-rotational Steiner triple systems. Des. Codes Cryptogr. 62(1): 63-78 (2012) - 2011
- [j1]Gloria Rinaldi, Tommaso Traetta:
Graph Products and New Solutions to Oberwolfach Problems. Electron. J. Comb. 18(1) (2011)
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-08-03 21:12 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:
