Concepedia

A. N. Glebov

AN

10

Publications

381

Citations

10

H-Index

2002

Active since

Affiliations

Sobolev Institute of Mathematics(Current)

Université de Bordeaux

Laboratoire Bordelais de Recherche en Informatique

Institut Polytechnique de Bordeaux

Center for Discrete Mathematics and Theoretical Computer Science

A. N. Glebov is an author at Sobolev Institute of Mathematics specializing in graph theory, discrete mathematics, and education.

Top concepts

Graph TheoryDiscrete MathematicsEducationGeometryEngineeringNetwork ScienceNetwork AnalysisCombinatorial Optimization

Publications per year

2002–2012

10

Publications

10

Planar graphs without cycles of length from 4 to 7 are 3-colorable

O. V. Borodin, A. N. Glebov, André Raspaud et al. · Journal of Combinatorial Theory Series B · 2004 · 140 citations

Geometric Graph Theory, Graph Theory, Topological Graph Theory +5

Stars and bunches in planar graphs. Part II: General planar graphs and colourings

O. V. Borodin, Hajo Broersma, A. N. Glebov et al. · Data Archiving and Networked Services (DANS) · 2002 · 50 citations · Full text

Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable

O. V. Borodin, A. N. Glebov, Mickaël Montassier et al. · Journal of Combinatorial Theory Series B · 2008 · 49 citations

Geometric Graph Theory, Graph Theory, Adjacent Triangles +6

Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable

O. V. Borodin, A. N. Glebov, André Raspaud · Discrete Mathematics · 2010 · 30 citations

Geometric Graph Theory, Graph Theory, Topological Graph Theory +5

Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable

O. V. Borodin, A. N. Glebov · Journal of Graph Theory · 2010 · 26 citations

Bordeaux Conjecture, Geometric Graph Theory, Towards Brdx3cc +9

Rows per page

1–5 of 10