Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs
Author
Abstract
Suggested Citation
DOI: 10.1007/s10878-015-9917-3
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- 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.
- 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.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- 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.
- 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.
- 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.- 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.
- 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.
- 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.
- 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.
- 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.
- Henning, Michael A. & Ananchuen, Nawarat & Kaemawichanurat, Pawaton, 2020. "Traceability of connected domination critical graphs," Applied Mathematics and Computation, Elsevier, vol. 386(C).
- 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.
- 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.
- 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.
More about this item
Keywords
$$mathcal {NP}$$ NP -completeness; Domination; Hamiltonianicity; Treewidth; Tree convex bipartite graphs;All these keywords.
Statistics
Access and download statisticsCorrections
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.