Uniform ( C k, P k +1 )-Factorizations of K n − I When k Is Even

Giovanni Lo Faro, Salvatore Milici and Antoinette Tripodi
Additional contact information
Giovanni Lo Faro: Dipartimento di Scienze Matematiche e Informatiche, Scienze Fisiche e Scienze della Terra, Università di Messina, 98166 Messina, Italy
Salvatore Milici: Dipartimento di Matematica e Informatica, Università di Catania, 95125 Catania, Italy
Antoinette Tripodi: Dipartimento di Scienze Matematiche e Informatiche, Scienze Fisiche e Scienze della Terra, Università di Messina, 98166 Messina, Italy

Mathematics, 2022, vol. 10, issue 6, 1-7

Abstract: 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 H of mutually non-isomorphic graphs, a uniform H -factorization of G is a partition of the edges of G into H -factors for some H ∈ H . In this article, we give a complete solution to the existence problem for uniform ( C k , P k + 1 ) -factorizations of K n − I in the case when k is even.

Keywords: graph factorization; complete graph; block design (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/6/936/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/6/936/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:6:p:936-:d:771376

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().