Author:
Babu Jasine,Prabhakaran Veena
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference13 articles.
1. Anderson M, Carrington JR, Brigham RC, Dutton R, Vitray RP (2014) Graphs simultaneously achieving three vertex cover numbers. J Comb Math Comb Comput 91:275–290
2. Babu J, Chandran LS, Francis M, Prabhakaran V, Rajendraprasad D, Warrier NJ (2021) On graphs whose eternal vertex cover number and vertex cover number coincide. Discrete Appl Math. https://doi.org/10.1016/j.dam.2021.02.004
3. Baker BS (1994) Approximation algorithms for NP-complete problems on planar graphs. J ACM 41(1):153–180
4. Chartrand G, Pippert RE (1974) Locally connected graphs. Časopis propěstování matematiky 99(2):158–163
5. Fomin FV, Gaspers S, Golovach PA, Kratsch D, Saurabh S (2010) Parameterized algorithm for eternal vertex cover. Inf Process Lett 110(16):702–706
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献