Li, Shiming; Yu, Wei; Liu, Zhaohui A local search algorithm for the \(k\)-path partition problem. (English) Zbl 07792593 Optim. Lett. 18, No. 1, 279-290 (2024). MSC: 90Cxx PDFBibTeX XMLCite \textit{S. Li} et al., Optim. Lett. 18, No. 1, 279--290 (2024; Zbl 07792593) Full Text: DOI
Malyshev, D. S.; Pristavchenko, O. V. An intractability result for the vertex 3-colourability problem. (English) Zbl 1495.05101 Optim. Lett. 16, No. 5, 1403-1409 (2022). Reviewer: Tanja Dravec (Maribor) MSC: 05C15 68Q17 PDFBibTeX XMLCite \textit{D. S. Malyshev} and \textit{O. V. Pristavchenko}, Optim. Lett. 16, No. 5, 1403--1409 (2022; Zbl 1495.05101) Full Text: DOI
Mokeev, Dmitry B.; Malyshev, Dmitry S. On partial descriptions of König graphs for odd paths and all their spanning supergraphs. (English) Zbl 1487.90563 Optim. Lett. 16, No. 2, 481-496 (2022). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{D. B. Mokeev} and \textit{D. S. Malyshev}, Optim. Lett. 16, No. 2, 481--496 (2022; Zbl 1487.90563) Full Text: DOI
Malyshev, D. S. The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable. (English) Zbl 1466.05075 Optim. Lett. 15, No. 2, 311-326 (2021). MSC: 05C15 68Q17 PDFBibTeX XMLCite \textit{D. S. Malyshev}, Optim. Lett. 15, No. 2, 311--326 (2021; Zbl 1466.05075) Full Text: DOI
Malyshev, D. S.; Razvenskaya, O. O.; Pardalos, P. M. The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs. (English) Zbl 1473.05092 Optim. Lett. 15, No. 1, 137-152 (2021). Reviewer: Steve Noble (London) MSC: 05C15 05C75 68Q17 PDFBibTeX XMLCite \textit{D. S. Malyshev} et al., Optim. Lett. 15, No. 1, 137--152 (2021; Zbl 1473.05092) Full Text: DOI
Mokeev, D. B.; Malyshev, D. S. A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs. (English) Zbl 1448.90084 Optim. Lett. 14, No. 6, 1317-1322 (2020). MSC: 90C27 90C35 90C60 PDFBibTeX XMLCite \textit{D. B. Mokeev} and \textit{D. S. Malyshev}, Optim. Lett. 14, No. 6, 1317--1322 (2020; Zbl 1448.90084) Full Text: DOI
Kloks, Ton; Wang, Yue-Li On retracts, absolute retracts, and foldings in cographs. (English) Zbl 1393.05187 Optim. Lett. 12, No. 3, 535-549 (2018). MSC: 05C60 68Q25 PDFBibTeX XMLCite \textit{T. Kloks} and \textit{Y.-L. Wang}, Optim. Lett. 12, No. 3, 535--549 (2018; Zbl 1393.05187) Full Text: DOI
Wiener, Gábor Depth first search in claw-free graphs. (English) Zbl 1400.90292 Optim. Lett. 12, No. 2, 367-373 (2018). MSC: 90C35 PDFBibTeX XMLCite \textit{G. Wiener}, Optim. Lett. 12, No. 2, 367--373 (2018; Zbl 1400.90292) Full Text: DOI Link
Silva, Ricardo M. A.; Silva, Diego M.; Resende, Mauricio G. C.; Mateus, Geraldo R.; Gonçalves, José F.; Festa, Paola An edge-swap heuristic for generating spanning trees with minimum number of branch vertices. (English) Zbl 1292.90305 Optim. Lett. 8, No. 4, 1225-1243 (2014). MSC: 90C35 90C59 PDFBibTeX XMLCite \textit{R. M. A. Silva} et al., Optim. Lett. 8, No. 4, 1225--1243 (2014; Zbl 1292.90305) Full Text: DOI Link