Glebov, Aleksey Nikolaevich Path partitioning planar graphs with restrictions on short cycles. (Russian. English summary) Zbl 1477.05141 Sib. Èlektron. Mat. Izv. 18, No. 2, 975-984 (2021). MSC: 05C70 05C38 05C10 05C15 05C12 PDFBibTeX XMLCite \textit{A. N. Glebov}, Sib. Èlektron. Mat. Izv. 18, No. 2, 975--984 (2021; Zbl 1477.05141) Full Text: DOI
Glebov, Alekseĭ Nikolaevich; Toktokhoeva, Surèna Garmazhapovna A polynomial algorithm with asymptotic ratio \(2/3\) for the asymmetric maximization version of the \(m\)-PSP. (Russian. English summary) Zbl 1495.90152 Diskretn. Anal. Issled. Oper. 27, No. 3, 28-52 (2020). MSC: 90C27 68W25 68W40 90C35 90C59 PDFBibTeX XMLCite \textit{A. N. Glebov} and \textit{S. G. Toktokhoeva}, Diskretn. Anal. Issled. Oper. 27, No. 3, 28--52 (2020; Zbl 1495.90152) Full Text: DOI MNR
Glebov, A. N.; Toktokhoeva, S. G. A polynomial 3/5-approximate algorithm for the asymmetric maximization version of the 3-PSP. (Russian, English) Zbl 1438.90284 Diskretn. Anal. Issled. Oper. 26, No. 2, 30-59 (2019); translation in J. Appl. Ind. Math. 13, No. 2, 219-238 (2019). MSC: 90C27 68W25 PDFBibTeX XMLCite \textit{A. N. Glebov} and \textit{S. G. Toktokhoeva}, Diskretn. Anal. Issled. Oper. 26, No. 2, 30--59 (2019; Zbl 1438.90284); translation in J. Appl. Ind. Math. 13, No. 2, 219--238 (2019) Full Text: DOI
Glebov, A. N.; Zambalaeva, D. Z. Path partitioning planar graphs of girth 4 without adjacent short cycles. (Russian. English summary) Zbl 1398.05070 Sib. Èlektron. Mat. Izv. 15, 1040-1047 (2018). MSC: 05C10 05C15 05C70 05C38 PDFBibTeX XMLCite \textit{A. N. Glebov} and \textit{D. Z. Zambalaeva}, Sib. Èlektron. Mat. Izv. 15, 1040--1047 (2018; Zbl 1398.05070)
Glebov, Aleksey N. Splitting a planar graph of girth 5 into two forests with trees of small diameter. (English) Zbl 1387.05055 Discrete Math. 341, No. 7, 2058-2067 (2018). MSC: 05C10 05C70 05C15 PDFBibTeX XMLCite \textit{A. N. Glebov}, Discrete Math. 341, No. 7, 2058--2067 (2018; Zbl 1387.05055) Full Text: DOI
Gimadi, E. Kh.; Glebov, A. N.; Skretneva, A. A.; Tsidulko, O. Yu.; Zambalaeva, D. Zh. Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph. (English) Zbl 1321.05101 Discrete Appl. Math. 196, 54-61 (2015). MSC: 05C22 05C20 05C82 05C45 90C35 PDFBibTeX XMLCite \textit{E. Kh. Gimadi} et al., Discrete Appl. Math. 196, 54--61 (2015; Zbl 1321.05101) Full Text: DOI
Glebov, A. N.; Zambalaeva, D. Zh. Partition of a planar graph with girth 6 into two forests with chain length at most 4. (Russian, English) Zbl 1324.05034 Diskretn. Anal. Issled. Oper. 21, No. 2, 33-51 (2014); translation in J. Appl. Ind. Math. 8, No. 3, 317-328 (2014). MSC: 05C10 05C38 05C70 PDFBibTeX XMLCite \textit{A. N. Glebov} and \textit{D. Zh. Zambalaeva}, Diskretn. Anal. Issled. Oper. 21, No. 2, 33--51 (2014; Zbl 1324.05034); translation in J. Appl. Ind. Math. 8, No. 3, 317--328 (2014) Full Text: DOI
Borodin, O. V.; Glebov, A. N.; Jensen, T. R. A step towards the strong version of Havel’s three color conjecture. (English) Zbl 1256.05068 J. Comb. Theory, Ser. B 102, No. 6, 1295-1320 (2012). MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{O. V. Borodin} et al., J. Comb. Theory, Ser. B 102, No. 6, 1295--1320 (2012; Zbl 1256.05068) Full Text: DOI
Borodin, Oleg V.; Glebov, Aleksei N. Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable. (English) Zbl 1237.05067 J. Graph Theory 66, No. 1, 1-31 (2011). Reviewer: Anders Sune Pedersen (Aarhus) MSC: 05C15 05C10 05C35 PDFBibTeX XMLCite \textit{O. V. Borodin} and \textit{A. N. Glebov}, J. Graph Theory 66, No. 1, 1--31 (2011; Zbl 1237.05067) Full Text: DOI
Borodin, O. V.; Glebov, A. N.; Raspaud, A. Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable. (English) Zbl 1203.05048 Discrete Math. 310, No. 20, 2584-2594 (2010). MSC: 05C15 PDFBibTeX XMLCite \textit{O. V. Borodin} et al., Discrete Math. 310, No. 20, 2584--2594 (2010; Zbl 1203.05048) Full Text: DOI
Borodin, O. V.; Glebov, A. N.; Montassier, M.; Raspaud, A. Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable. (English) Zbl 1184.05024 J. Comb. Theory, Ser. B 99, No. 4, 668-673 (2009). Reviewer: Arthur T. White (Kalamazoo) MSC: 05C10 05C15 PDFBibTeX XMLCite \textit{O. V. Borodin} et al., J. Comb. Theory, Ser. B 99, No. 4, 668--673 (2009; Zbl 1184.05024) Full Text: DOI