A. N. Glebov

Available identifiers

zbMath Open glebov.aleksei-nikolaevichMaRDI QIDQ1750784

List of research outcomes

Publication	Date of Publication	Type
A polynomial algorithm with asymptotic ratio $2/3$ for the asymmetric maximization version of the $m$-PSP	2022-07-15	Paper
Path partitioning planar graphs with restrictions on short cycles	2021-10-19	Paper
Vertex colourings of multigraphs with forbiddances on edges	2020-05-21	Paper
Colouring planar graphs with bounded monochromatic components	2020-05-21	Paper
A Polynomial 3/5-Approximate Algorithm for the Asymmetric Maximization Version of the 3-PSP	2019-12-02	Paper
Path partitioning planar graphs of girth 4 without adjacent short cycles	2018-10-31	Paper
Splitting a planar graph of girth 5 into two forests with trees of small diameter	2018-05-24	Paper
An enhancement of Nash-Williams' theorem on edge arboricity of graphs	2018-05-23	Paper
An Algorithm with Approximation Ratio 5/6 for the Metric Maximum m-PSP	2018-02-13	Paper
\(7/5\)-approximation algorithm for 2-PSP on minimum with different weight functions	2015-11-16	Paper
Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph	2015-09-30	Paper
Partition of a planar graph with girth 6 into two forests with chain length at most 4	2015-07-27	Paper
A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem	2015-07-27	Paper
A step towards the strong version of Havel's three color conjecture	2013-01-14	Paper
https://portal.mardi4nfdi.de/entity/Q3115273	2012-02-20	Paper
https://portal.mardi4nfdi.de/entity/Q3115278	2012-02-20	Paper
https://portal.mardi4nfdi.de/entity/Q3115668	2012-02-10	Paper
Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable	2011-01-20	Paper
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable	2010-10-18	Paper
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable	2009-06-23	Paper
Path partitions of planar graphs	2008-04-14	Paper
Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable	2007-07-02	Paper
A new upper bound on the cyclic chromatic number	2007-01-24	Paper
Continuation of a 3-coloring from a 7-face onto a plane graph without \(C_3\)	2005-12-19	Paper
Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable	2005-12-12	Paper
Smaller planar triangle-free graphs that are not 3-list-colorable	2005-04-18	Paper
Planar graphs without cycles of length from 4 to 7 are 3-colorable	2005-03-08	Paper
https://portal.mardi4nfdi.de/entity/Q4812233	2004-09-07	Paper
https://portal.mardi4nfdi.de/entity/Q4812230	2004-09-07	Paper
https://portal.mardi4nfdi.de/entity/Q4811813	2004-09-06	Paper
https://portal.mardi4nfdi.de/entity/Q4797462	2003-03-16	Paper
https://portal.mardi4nfdi.de/entity/Q4797463	2003-03-16	Paper
https://portal.mardi4nfdi.de/entity/Q4797465	2003-03-16	Paper
The structure of the planar triangulations in terms of bundles and stars	2001-12-13	Paper
A structural property of planar graphs	2001-06-10	Paper

Research outcomes over time

This page was built for person: A. N. Glebov