default search action
Gloria Rinaldi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j20]Gloria Rinaldi
:
Quaternionic 1-Factorizations and Complete Sets of Rainbow Spanning Trees. Graphs Comb. 39(1): 15 (2023) - 2021
- [j19]Simona Bonvicini, Marco Buratti
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
- [j18]Giuseppe Mazzuoccolo
Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations. Discret. Math. 342(4): 1006-1016 (2019) - 2017
- [j17]Marco Buratti, Gloria Rinaldi, Tommaso Traetta
3-pyramidal Steiner triple systems. Ars Math. Contemp. 13(1): 95-106 (2017) - 2013
- [j16]Marco Buratti, Stefano Capparelli
A collection of results on Hamiltonian cycle systems with a nice automorphism group. Electron. Notes Discret. Math. 40: 245-252 (2013) - [j15]Mathieu Bogaerts, Giuseppe Mazzuoccolo
Invariant Kekulé structures in fullerene graphs. Electron. Notes Discret. Math. 40: 323-327 (2013) - 2012
- [j14]Simona Bonvicini
Some progress on the existence of 1-rotational Steiner triple systems. Des. Codes Cryptogr. 62(1): 63-78 (2012) - 2011
- [j13]Gloria Rinaldi, Tommaso Traetta:
Graph Products and New Solutions to Oberwolfach Problems. Electron. J. Comb. 18(1) (2011) - 2010
- [j12]Giuseppe Mazzuoccolo
Sharply Transitive 1-Factorizations of Complete Multipartite Graphs. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j11]Marco Buratti, Gloria Rinaldi
A non-existence result on cyclic cycle-decompositions of the cocktail party graph. Discret. Math. 309(14): 4722-4726 (2009) - 2007
- [j10]Giuseppe Mazzuoccolo
k -Pyramidal One-Factorizations. Graphs Comb. 23(3): 315-326 (2007) - 2006
- [j9]Gloria Rinaldi
One-factorizations of complete graphs with regular automorphism groups. Electron. Notes Discret. Math. 24: 195-198 (2006) - 2005
- [j8]Simona Bonvicini, Gloria Rinaldi:
Minkowski tangent-circle structures and key distribution patterns. Australas. J Comb. 31: 179-188 (2005) - [j7]Arrigo Bonisoli
On two-transitive parabolic ovals. Discret. Math. 294(1-2): 13-19 (2005) - [j6]Arrigo Bonisoli
Quaternionic Starters. Graphs Comb. 21(2): 187-195 (2005) - [j5]Marco Buratti, Gloria Rinaldi
On sharply vertex transitive 2-factorizations of the complete graph. J. Comb. Theory A 111(2): 245-256 (2005) - 2004
- [j4]Gloria Rinaldi
Key Distribution Patterns Using Tangent Circle Structures. Des. Codes Cryptogr. 31(3): 289-300 (2004) - 2003
- [j3]Arrigo Bonisoli
Primitive collineation groups of ovals with a fixed point. Eur. J. Comb. 24(7): 797-807 (2003) - 2001
- [j2]Gloria Rinaldi
Inversive Planes, Minkowski Planes and Regular Sets of Points. Eur. J. Comb. 22(3): 357-363 (2001)
1990 – 1999
- 1999
- [j1]Gloria Rinaldi
Transformation Systems for Incidence Structures. Eur. J. Comb. 20(4): 307-312 (1999)
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:20 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: