König graphs for 3-paths and 3-cycles. - Vladimir E. Alekseev; Dmitry B. Mokeev (Discret. Appl. Math., 2016)

A polynomial-time algorithm of finding a minimum k-path vertex cover and a maximum k-path packing in some graphs. - Dmitry B. Mokeev; Dmitriy S. Malyshev (Optim. Lett., 2020)

On partial descriptions of König graphs for odd paths and all their spanning supergraphs. - Dmitry B. Mokeev; Dmitry S. Malyshev (Optim. Lett., 2022)