Hitting subgraphs in P4-tidy graphs
Author
Abstract
Suggested Citation
DOI: 10.1016/j.amc.2019.01.074
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
- Li, Zhao & Zuo, Liancui, 2018. "The k-path vertex cover in Cartesian product graphs and complete bipartite graphs," Applied Mathematics and Computation, Elsevier, vol. 331(C), pages 69-79.
- Li, Yuchao & Yang, Zishen & Wang, Wei, 2017. "Complexity and algorithms for the connected vertex cover problem in 4-regular graphs," Applied Mathematics and Computation, Elsevier, vol. 301(C), pages 107-114.
- Tu, Jianhua, 2017. "Efficient algorithm for the vertex cover Pk problem on cacti," Applied Mathematics and Computation, Elsevier, vol. 311(C), pages 217-222.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Iztok Peterin & Gabriel Semanišin, 2021. "On the Maximal Shortest Paths Cover Number," Mathematics, MDPI, vol. 9(14), pages 1-10, July.
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.- Vasily V. Gusev, 2021. "Set-weighted games and their application to the cover problem," HSE Working papers WP BRP 247/EC/2021, National Research University Higher School of Economics.
- Boris Brimkov & Derek Mikesell & Logan Smith, 2019. "Connected power domination in graphs," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 292-315, July.
- Gledel, Valentin & Iršič, Vesna & Klavžar, Sandi, 2019. "Strong geodetic cores and Cartesian product graphs," Applied Mathematics and Computation, Elsevier, vol. 363(C), pages 1-1.
- Gusev, Vasily V., 2023. "Set-weighted games and their application to the cover problem," European Journal of Operational Research, Elsevier, vol. 305(1), pages 438-450.
- Yuchao Li & Wei Wang & Zishen Yang, 2019. "The connected vertex cover problem in k-regular graphs," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 635-645, August.
More about this item
Keywords
Hitting set; Decycling number; k-path vertex cover; P4-tidy graph; Quasi-spider;All these keywords.
JEL classification:
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:eee:apmaco:v:352:y:2019:i:c:p:211-219. 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.