IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i6p936-d771376.html
   My bibliography  Save this article

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

Author

Listed:
  • 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)

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.

Suggested Citation

  • Giovanni Lo Faro & Salvatore Milici & Antoinette Tripodi, 2022. "Uniform ( C k , P k +1 )-Factorizations of K n − I When k Is Even," Mathematics, MDPI, vol. 10(6), pages 1-7, March.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:6:p:936-:d:771376
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/6/936/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/6/936/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:6:p:936-:d:771376. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.