default search action
Salvatore Milici
Person information
- affiliation: University of Catania, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j38]Paola Bonacini
, Selda Küçükçifçi, Salvatore Milici, Emine Sule Yazici:
On uniformly resolvable $(C_4,K_{1,3})$-designs. Contributions Discret. Math. 17(2): 1-22 (2022) - 2021
- [j37]Csilla Bujtás, Mario Gionfriddo, Elena Guardo
Complex uniformly resolvable decompositions of K_v. Ars Math. Contemp. 21(1) (2021) - 2020
- [j36]Melissa S. Keranen, Donald L. Kreher, Salvatore Milici, Antoinette Tripodi:
Uniformly resolvable decompositions of Kv in 1-factors and 4-stars. Australas. J Comb. 76: 55-72 (2020)
2010 – 2019
- 2018
- [j35]Mario Gionfriddo, Selda Küçükçifçi, Salvatore Milici, Emine Sule Yazici:
Uniformly resolvable $(C_4, K_{1, 3})$-designs of order v and. Contributions Discret. Math. 13(1) (2018) - 2017
- [j34]Selda Küçükçifçi, Salvatore Milici:
Decomposition of λKv into kites and 4-cycles. Ars Comb. 131: 299-319 (2017) - [j33]Mario Gionfriddo, Giovanni Lo Faro, Salvatore Milici, Antoinette Tripodi:
α-Resolvable λ-fold G-designs. Contributions Discret. Math. 12(1) (2017) - 2016
- [j32]Mario Gionfriddo, Giovanni Lo Faro, Salvatore Milici, Antoinette Tripodi:
The spectrum of α-resolvable λ-fold (K_4 - e)-designs. Ars Math. Contemp. 10(2): 371-381 (2016) - 2015
- [j31]Mario Gionfriddo, Salvatore Milici:
On uniformly resolvable {K2, Pk}-designs with with k=3, 4. Contributions Discret. Math. 10(1) (2015) - [j30]Selda Küçükçifçi, Giovanni Lo Faro
Resolvable 3-star designs. Discret. Math. 338(4): 608-614 (2015) - [j29]Selda Küçükçifçi, Salvatore Milici
Maximum uniformly resolvable decompositions of Kv and Kv-I into 3-stars and 3-cycles. Discret. Math. 338(10): 1667-1673 (2015) - [j28]Giovanni Lo Faro
Uniformly resolvable decompositions of Kv into paths on two, three and four vertices. Discret. Math. 338(12): 2212-2219 (2015) - 2014
- [j27]Mario Gionfriddo, Salvatore Milici:
Uniformly resolvable ℋ-designs with ℋ={P3, 4}. Australas. J Comb. 60: 325-332 (2014) - [j26]Salvatore Milici, Gaetano Quattrocchi, Zsolt Tuza:
G-designs without blocking sets, Note. Ars Comb. 114: 229-233 (2014) - [j25]Salvatore Milici
Uniformly resolvable decompositions of Kv into P3 and K3 graphs. Discret. Math. 331: 137-141 (2014) - 2013
- [j24]Salvatore Milici:
A note on uniformly resolvable decompositions of Kv and Kv-I into 2-stars and 4-cycles. Australas. J Comb. 56: 195-200 (2013) - [j23]Mario Gionfriddo, Salvatore Milici:
Minimum embedding of a K3-design into a balanced incomplete block design of index λ ≥ 2. Ars Comb. 112: 279-292 (2013) - [j22]Mario Gionfriddo
On the existence of uniformly resolvable decompositions of Kv and Kv-I-I into paths and kites. Discret. Math. 313(23): 2830-2834 (2013) - [j21]Mario Gionfriddo
Octagon kite systems. Electron. Notes Discret. Math. 40: 129-134 (2013) - 2012
- [j20]Salvatore Milici
Small embedding of an S3(2, 4, u) into an Sλ(2, 4, u+w). Discret. Math. 312(3): 509-516 (2012) - 2010
- [j19]Salvatore Milici, Giorgio Ragusa:
Maximum embedding of an H(v-w, 3, 1) into a TS(v, λ). Australas. J Comb. 46: 121-128 (2010)
2000 – 2009
- 2009
- [j18]Peter Danziger, Salvatore Milici
Minimum embedding of a P4-design into a balanced incomplete block design of index lambda. Discret. Math. 309(14): 4861-4870 (2009) - 2008
- [j17]Salvatore Milici
Minimum embedding of P3-designs into TS(v, lambda). Discret. Math. 308(2-3): 331-338 (2008) - 2004
- [j16]Salvatore Milici
Coverings of a complete graph with five-vertex and five-edge graphs. Discret. Math. 284(1-3): 225-229 (2004) - 2002
- [j15]Salvatore Milici, Gaetano Quattrocchi:
On nesting of G-decompositions of lambdaKv where G has four nonisolated vertices or les. Discret. Math. 255(1-3): 297-315 (2002) - 2001
- [j14]Salvatore Milici
Colouring Steiner systems with specified block colour patterns. Discret. Math. 240(1-3): 145-160 (2001)
1990 – 1999
- 1999
- [j13]Salvatore Milici, Gaetano Quattrocchi:
Embedding handcuffed designs with block size 2 or 3 in 4-cycle systems. Discret. Math. 208-209: 443-449 (1999) - [j12]Salvatore Milici, Zsolt Tuza:
Disjoint blocking sets in cycle systems. Discret. Math. 208-209: 451-462 (1999) - 1997
- [j11]Salvatore Milici, Gaetano Quattrocchi:
The fine structure of threefold directed triple systems. Australas. J Comb. 16: 125-154 (1997) - 1996
- [j10]Mario Gionfriddo, Salvatore Milici:
A result concerning two conjectures of Berge and Chvátal. Discret. Math. 155(1-3): 77-79 (1996) - [j9]Salvatore Milici
Support Sizes of Directed Triple Systems. J. Comb. Theory A 75(2): 198-219 (1996) - 1995
- [j8]Salvatore Milici
Embeddings of simple maximum packings of triples with lambda even. Discret. Math. 145(1-3): 191-200 (1995) - 1994
- [j7]Mario Gionfriddo, Salvatore Milici, Zsolt Tuza:
Blocking Sets in SQS(2u). Comb. Probab. Comput. 3: 77-86 (1994) - [j6]Salvatore Milici
The spectrum of lambda-times repeated blocks for TS(upsilon, lambda). Discret. Math. 129(1-3): 159-166 (1994) - 1993
- [j5]Salvatore Milici:
Blocking sets in handcuffed designs. Australas. J Comb. 7: 229-236 (1993) - [j4]Gaetano Quattrocchi, Salvatore Milici
Repeated blocks in maximum packing of triples with index 2. Discret. Math. 115(1-3): 287-291 (1993) - 1991
- [j3]Salvatore Milici
Indecomposable S6(2, 3, v)'s. J. Comb. Theory A 56(1): 16-26 (1991)
1980 – 1989
- 1988
- [j2]Mario Gionfriddo
On the parameter v2(h)<=6h for L2-coloured graphs. Discret. Math. 68(1): 107-110 (1988) - [j1]Salvatore Milici
The spectrum for three-times repeated blocks in a S3(2, 3, v). J. Comb. Theory A 49(1): 117-128 (1988)
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-05 20:19 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: