Salvatore Milici
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Salvatore Milici has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Mario Gionfriddo
Department of Mathematics and Computer Science, University of Catania, 95125 Catania, Italy
14 shared publications - Antoinette Tripodi
Dipartimento di Scienze Matematiche e Informatiche, Scienze Fisiche e Scienze della Terra, Università di Messina, 98166 Messina, Italy
11 shared publications - Giovanni Lo Faro
Dipartimento di Scienze Matematiche e Informatiche, Scienze Fisiche e Scienze della Terra, Università di Messina, 98166 Messina, Italy
11 shared publications Gaetano Quattrocchi
6 shared publications- Selda Küçükçifçi
Koc University
6 shared publications Zsolt Tuza
4 shared publications
Latest Publications
- Open Access
- 11 August 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (16) , 3479
Uniform {Ch,S(Ch)}-Factorizations of Kn−I for Even h
Let H be a connected subgraph of a graph G. An H-factor of G is a spanning subgraph of G whose components are isomorphic to H. Given a set of mutually non-isomorphic graphs, a uniform -factorization of G is a partition of the edges of G into H-factors for some . In this article, we give a complete solution to the existence problem of uniform -factorizations of (the graph obtained by removing a 1-factor from the complete graph ) for , where is a cycle of length an even integer and is the graph consisting of the cycle with a pendant edge attached to each vertex.- 11 August 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (16) , 3479
Open AccessUniform {Ch,S(Ch)}-Factorizations of Kn−I for Even h
Let H be a connected subgraph of a graph G. An H-factor of G is a spanning subgraph of G whose components are isomorphic to H. Given a set of mutually non-isomorphic graphs, a uniform -factorization of G is a partition of the edges of G into H-factors for some . In this article, we give a complete solution to the existence problem of uniform -factorizations of (the graph obtained by removing a 1-factor from the complete graph ) for , where is a cycle of length an even integer and is the graph consisting of the cycle with a pendant edge attached to each vertex. - Open Access
- 15 March 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (6) , 936
Uniform (Ck, Pk+1)-Factorizations of Kn − I When k Is Even
Let H be a connected subgraph of a graph G. An H-factor of G is a spanning subgraph of G whose components are isomorphic to H. Given a set of mutually non-isomorphic graphs, a uniform -factorization of G is a partition of the edges of G into H-factors for some . In this article, we give a complete solution to the existence problem for uniform -factorizations of in the case when k is even.- 15 March 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (6) , 936
Open AccessUniform (Ck, Pk+1)-Factorizations of Kn − I When k Is Even
Let H be a connected subgraph of a graph G. An H-factor of G is a spanning subgraph of G whose components are isomorphic to H. Given a set of mutually non-isomorphic graphs, a uniform -factorization of G is a partition of the edges of G into H-factors for some . In this article, we give a complete solution to the existence problem for uniform -factorizations of in the case when k is even. - 10 August 2021
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 21 (1) , #P1.02
Complex uniformly resolvable decompositions of K_v
In this paper we consider complex uniformly resolvable decompositions of the complete graph Kv into subgraphs such that each resolution class contains only blocks isomorphic to the same graph from a given set ℋ and at least one parallel class is present from each graph of ℋ. We completely determine the spectrum for the cases ℋ = {K2, P3, K3}, ℋ = {P4, C4}, and ℋ = {K2, P4, C4}.
- 10 August 2021
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 21 (1) , #P1.02
Complex uniformly resolvable decompositions of K_v
In this paper we consider complex uniformly resolvable decompositions of the complete graph Kv into subgraphs such that each resolution class contains only blocks isomorphic to the same graph from a given set ℋ and at least one parallel class is present from each graph of ℋ. We completely determine the spectrum for the cases ℋ = {K2, P3, K3}, ℋ = {P4, C4}, and ℋ = {K2, P4, C4}.
- Open Access
- 13 October 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (10) , 1755
Uniformly Resolvable Decompositions of Kv-I into n-Cycles and n-Stars, for Even n
If X is a connected graph, then an X-factor of a larger graph is a spanning subgraph in which all of its components are isomorphic to X. Given a set of pairwise non-isomorphic graphs, a uniformly resolvable Γ-decomposition of a graph G is an edge decomposition of G into X-factors for some graph . In this article we completely solve the existence problem for decompositions of -I into -factors and -factors in the case when n is even.- 13 October 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (10) , 1755
Open AccessUniformly Resolvable Decompositions of Kv-I into n-Cycles and n-Stars, for Even n
If X is a connected graph, then an X-factor of a larger graph is a spanning subgraph in which all of its components are isomorphic to X. Given a set of pairwise non-isomorphic graphs, a uniformly resolvable Γ-decomposition of a graph G is an edge decomposition of G into X-factors for some graph . In this article we completely solve the existence problem for decompositions of -I into -factors and -factors in the case when n is even. - Open Access
- 29 January 2018
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 13 (1)
Uniformly resolvable (C4, K1,3) -designs of index 2
In this paper we consider the uniformly resolvable decompositions of the complete graph $\lambda K_v$ into subgraphs where each resolution class contains only blocks isomorphic to the same graph. We consider the cases in which all the resolution classes are either $C_4$ or $K_{1,3}$. We prove that this type of system does not exist for $\lambda$ odd and determine completely the spectrum for $\lambda=2$.- 29 January 2018
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 13 (1)
Open AccessUniformly resolvable (C4, K1,3) -designs of index 2
In this paper we consider the uniformly resolvable decompositions of the complete graph $\lambda K_v$ into subgraphs where each resolution class contains only blocks isomorphic to the same graph. We consider the cases in which all the resolution classes are either $C_4$ or $K_{1,3}$. We prove that this type of system does not exist for $\lambda$ odd and determine completely the spectrum for $\lambda=2$. - Open Access
- 27 September 2017
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 12 (1)
α-Resolvable λ-fold G-designs
A λ-fold G-design is said to be α-resolvable if its blocks can be partitioned into classes such that every class contains each vertex exactly α times. In this paper we study the existence problem of an α-resolvable λ-fold G-design of order v in the case when G is any connected subgraph of K_4 and prove that the necessary conditions for its existence are also sufficient.
- 27 September 2017
- Published by University of Calgary in Contributions to Discrete Mathematics
- Vol. 12 (1)
Open Accessα-Resolvable λ-fold G-designs
A λ-fold G-design is said to be α-resolvable if its blocks can be partitioned into classes such that every class contains each vertex exactly α times. In this paper we study the existence problem of an α-resolvable λ-fold G-design of order v in the case when G is any connected subgraph of K_4 and prove that the necessary conditions for its existence are also sufficient.
- 1 March 2016
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 10 (2) , 371-381
The spectrum of α-resolvable λ-fold (K_4 - e)-designs
A λ-fold G-design is said to be α-resolvable if its blocks can be partitioned into classes such that every class contains each vertex exactly α times. In this paper we study the α-resolvability for λ-fold (K4 − e)-designs and prove that the necessary conditions for their existence are also sufficient, without any exception.
- 1 March 2016
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 10 (2) , 371-381
The spectrum of α-resolvable λ-fold (K_4 - e)-designs
A λ-fold G-design is said to be α-resolvable if its blocks can be partitioned into classes such that every class contains each vertex exactly α times. In this paper we study the α-resolvability for λ-fold (K4 − e)-designs and prove that the necessary conditions for their existence are also sufficient, without any exception.
- 1 December 2015
- Published by Elsevier in Discrete Mathematics
- Vol. 338 (12) , 2212-2219
Uniformly resolvable decompositions of into paths on two, three and four vertices- 1 December 2015
- Published by Elsevier in Discrete Mathematics
- Vol. 338 (12) , 2212-2219
Uniformly resolvable decompositions of into paths on two, three and four vertices- 1 October 2015
- Published by Elsevier in Discrete Mathematics
- Vol. 338 (10) , 1667-1673
Maximum uniformly resolvable decompositions of and into 3-stars and 3-cycles- 1 October 2015
- Published by Elsevier in Discrete Mathematics
- Vol. 338 (10) , 1667-1673
Maximum uniformly resolvable decompositions of and into 3-stars and 3-cycles