Sangram K. Jena, K. Subramani. Analyzing the 3-path vertex cover problem in selected graph classes. // Journal of Combinatorial Optimization. – 2025. – DOI: 10.1007/s10878-025-01285-4. – URL: https://doi.org/10.1007/s10878-025-01285-4
Sangram K. Jena & K. Subramani (2025). Analyzing the 3-path vertex cover problem in selected graph classes. Journal of Combinatorial Optimization. https://doi.org/10.1007/s10878-025-01285-4
Sangram K. Jena and K. Subramani. “Analyzing the 3-path vertex cover problem in selected graph classes.” Journal of Combinatorial Optimization, 2025. doi:10.1007/s10878-025-01285-4.
@article{Jena2025,
title = {Analyzing the 3-path vertex cover problem in selected graph classes},
author = {Jena, Sangram K. and Subramani, K.},
journal = {Journal of Combinatorial Optimization},
year = {2025},
doi = {10.1007/s10878-025-01285-4},
url = {https://doi.org/10.1007/s10878-025-01285-4}
}