The following pages link to Alekseĭ Nikolaevich Glebov (Q1750784):
Displayed 36 items.
- Item:Q1750784 (redirect page) (← links)
- Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph (Q499338) (← links)
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301) (← links)
- \(7/5\)-approximation algorithm for 2-PSP on minimum with different weight functions (Q890881) (← links)
- Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable (Q1026007) (← links)
- Path partitioning planar graphs of girth 4 without adjacent short cycles (Q1615735) (← links)
- An enhancement of Nash-Williams' theorem on edge arboricity of graphs (Q1750785) (← links)
- Splitting a planar graph of girth 5 into two forests with trees of small diameter (Q1752682) (← links)
- Planar graphs without cycles of length from 4 to 7 are 3-colorable (Q1767673) (← links)
- Smaller planar triangle-free graphs that are not 3-list-colorable (Q1772422) (← links)
- A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
- Colouring planar graphs with bounded monochromatic components (Q2182229) (← links)
- Vertex colourings of multigraphs with forbiddances on edges (Q2182245) (← links)
- Path partitioning planar graphs with restrictions on short cycles (Q2234425) (← links)
- Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable (Q2371269) (← links)
- Path partitions of planar graphs (Q2481195) (← links)
- Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable (Q2575546) (← links)
- Continuation of a 3-coloring from a 7-face onto a plane graph without \(C_3\) (Q2577175) (← links)
- (Q2713988) (← links)
- (Q2760687) (← links)
- Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable (Q3067058) (← links)
- (Q3115273) (← links)
- (Q3115278) (← links)
- (Q3115668) (← links)
- An Algorithm with Approximation Ratio 5/6 for the Metric Maximum m-PSP (Q3133209) (← links)
- A new upper bound on the cyclic chromatic number (Q3418734) (← links)
- (Q4797462) (← links)
- (Q4797463) (← links)
- (Q4797465) (← links)
- (Q4811813) (← links)
- (Q4812230) (← links)
- (Q4812233) (← links)
- A Polynomial 3/5-Approximate Algorithm for the Asymmetric Maximization Version of the 3-PSP (Q4973249) (← links)
- A polynomial algorithm with asymptotic ratio $2/3$ for the asymmetric maximization version of the $m$-PSP (Q5090157) (← links)
- Partition of a planar graph with girth 6 into two forests with chain length at most 4 (Q5264731) (← links)
- A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem (Q5264766) (← links)