IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v32y2016i1d10.1007_s10878-015-9917-3.html
   My bibliography  Save this article

Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs

Author

Listed:
  • Hao Chen

    (Peking University)

  • Zihan Lei

    (Peking University)

  • Tian Liu

    (Peking University)

  • Ziyang Tang

    (Peking University)

  • Chaoyi Wang

    (Peking University)

  • Ke Xu

    (Beihang University)

Abstract

Tree convex bipartite graphs generalize convex bipartite graphs by associating a tree, instead of a path, with one set of the vertices, such that for every vertex in another set, the neighborhood of this vertex induces a subtree. There are seven graph problems, grouped into three classes of domination, Hamiltonicity and treewidth, which are known to be $$\mathcal {NP}$$ NP -complete for bipartite graphs, but tractable for convex bipartite graphs. We show $$\mathcal {NP}$$ NP -completeness of these problems for tree convex bipartite graphs, even when the associated trees are stars or combs respectively.

Suggested Citation

  • Hao Chen & Zihan Lei & Tian Liu & Ziyang Tang & Chaoyi Wang & Ke Xu, 2016. "Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs," Journal of Combinatorial Optimization, Springer, vol. 32(1), pages 95-110, July.
  • Handle: RePEc:spr:jcomop:v:32:y:2016:i:1:d:10.1007_s10878-015-9917-3
    DOI: 10.1007/s10878-015-9917-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9917-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-015-9917-3?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. Lei Chen & Changhong Lu & Zhenbing Zeng, 2010. "Labelling algorithms for paired-domination problems in block and interval graphs," Journal of Combinatorial Optimization, Springer, vol. 19(4), pages 457-470, May.
    2. Tian Liu & Zhao Lu & Ke Xu, 2015. "Tractable connected domination for restricted bipartite graphs," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 247-256, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. D. H. Aneesh & A. Mohanapriya & P. Renjith & N. Sadagopan, 2022. "Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1221-1247, September.
    2. B. S. Panda & Arti Pandey & Juhi Chaudhary & Piyush Dane & Manav Kashyap, 0. "Maximum weight induced matching in some subclasses of bipartite graphs," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-20.
    3. B. S. Panda & Arti Pandey & Juhi Chaudhary & Piyush Dane & Manav Kashyap, 2020. "Maximum weight induced matching in some subclasses of bipartite graphs," Journal of Combinatorial Optimization, Springer, vol. 40(3), pages 713-732, October.

    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.
    1. B. S. Panda & Arti Pandey & Juhi Chaudhary & Piyush Dane & Manav Kashyap, 2020. "Maximum weight induced matching in some subclasses of bipartite graphs," Journal of Combinatorial Optimization, Springer, vol. 40(3), pages 713-732, October.
    2. Changhong Lu & Qingjie Ye & Chengru Zhu, 2022. "Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 2029-2039, October.
    3. D. Pradhan & Anupriya Jha, 2018. "On computing a minimum secure dominating set in block graphs," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 613-631, February.
    4. Changhong Lu & Qingjie Ye & Chengru Zhu, 0. "Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-11.
    5. Chao Wang & Lei Chen & Changhong Lu, 2016. "$$k$$ k -Power domination in block graphs," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 865-873, February.
    6. Yancai Zhao & Erfang Shan, 2016. "An efficient algorithm for distance total domination in block graphs," Journal of Combinatorial Optimization, Springer, vol. 31(1), pages 372-381, January.
    7. Ching-Chi Lin & Cheng-Yu Hsieh & Ta-Yu Mu, 2022. "A linear-time algorithm for weighted paired-domination on block graphs," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 269-286, August.
    8. B. S. Panda & Arti Pandey & Juhi Chaudhary & Piyush Dane & Manav Kashyap, 0. "Maximum weight induced matching in some subclasses of bipartite graphs," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-20.
    9. Henning, Michael A. & Ananchuen, Nawarat & Kaemawichanurat, Pawaton, 2020. "Traceability of connected domination critical graphs," Applied Mathematics and Computation, Elsevier, vol. 386(C).

    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:spr:jcomop:v:32:y:2016:i:1:d:10.1007_s10878-015-9917-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.