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 (Ck,Pk+1)-factorizations of Kn−I in the case when k is even
Uniform (Ck, Pk+1)-Factorizations of Kn − I When k Is Even
Milici, Salvatore;
2022-01-01
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 (Ck,Pk+1)-factorizations of Kn−I in the case when k is evenFile in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
mathematics-10-00936.pdf
accesso aperto
Tipologia:
Versione Editoriale (PDF)
Licenza:
Creative commons
Dimensione
275.94 kB
Formato
Adobe PDF
|
275.94 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
