IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v332y2018icp90-95.html
   My bibliography  Save this article

Partitioning the Cartesian product of a tree and a cycle

Author

Listed:
  • Liu, Fengxia
  • Wu, Baoyindureng
  • Meng, Jixiang

Abstract

Let G=(V,E) be a graph of order n, and λ=(λ1,λ2,…,λp) a sequence of positive integers. The sequence λ is admissible for G if λ1+⋯+λp=n. Such an admissible sequence λ is said to be realizable in G if there exists a partition (V1,V2,…,Vp) of the vertex set V such that Vi induces a connected subgraph of order ni in G for each i. If every admissible sequence is realizable in G, then we say that G is arbitrarily partitionable (AP, for short). We show that if a tree T of maximum degree at most n+1 has a path containing all the vertices of degree n+1, then T□Cn has a Hamiltonian path. In particular, for any caterpillar T with maximum degree at most n+1,T□Cn is AP. In addition, if T is a caterpillar with Δ(T)≥n+4, then T□Cn is not AP. For the cases n+2≤Δ(T)≤n+3, we present some sufficient conditions for a caterpillar T such that T□Cn is AP.

Suggested Citation

  • Liu, Fengxia & Wu, Baoyindureng & Meng, Jixiang, 2018. "Partitioning the Cartesian product of a tree and a cycle," Applied Mathematics and Computation, Elsevier, vol. 332(C), pages 90-95.
    • Handle: RePEc:eee:apmaco:v:332:y:2018:i:c:p:90-95
    DOI: 10.1016/j.amc.2018.03.015
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318301802
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.03.015?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Julien Bensmail, 2015. "On the complexity of partitioning a graph into a few connected subgraphs," Journal of Combinatorial Optimization, Springer, vol. 30(1), pages 174-187, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:eee:apmaco:v:332:y:2018:i:c:p:90-95. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

      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.