Publisher
Springer Nature Switzerland
Reference36 articles.
1. Andreatta, G., Mason, F.: Path covering problems and testing of printed circuits. Disc. Appl. Math. 62(1), 5–13 (1995)
2. Arokiaraj, A., Klavžar, S., Manuel, P.D., Thomas, E., Xavier, A.: Strong geodetic problems in networks. Discussiones Mathematicae Graph Theory 40(1), 307–321 (2020)
3. Atici, M.: On the edge geodetic number of a graph. Int. J. Comput. Math. 80(7), 853–861 (2003)
4. Cáceres, M., Cairo, M., Mumey, B., Rizzi, R., Tomescu, A.I.: Sparsifying, shrinking and splicing for minimum path cover in parameterized linear time. In: Proceedings of SODA 2022, pp. 359–376. SIAM (2022)
5. Chakraborty, D., Dailly, A., Das, S., Foucaud, F., Gahlawat, H., Ghosh, S.K.: Complexity and algorithms for isometric path cover on chordal graphs and beyond. In: Proceedings of ISAAC 2022, LIPIcs, vol. 248, pp. 12:1–12:17 (2022)