Concepedia
Statistics
Publications
10
Citations
388
H-Index
Active since
2002
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 combinatorics, graph theory, and planar graphs.
Publications per year
2002–2012
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 · 144 citations
Natural Sciences, Materials Science, Combinatorics +5
Stars and bunches in planar graphs. Part II: General planar graphs and colourings
O. V. Borodin, Hajo Broersma, A. N. Glebov et al. · University of Twente Research Information · 2002 · 50 citations · Full text
Natural Sciences, Computer Science, Mathematics +9
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 · 50 citations
Computing, Visualization, Combinatorics +9
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 · 31 citations
Natural Sciences, Mathematics, Combinatorics +8
Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable
O. V. Borodin, A. N. Glebov · Journal of Graph Theory · 2010 · 27 citations
Natural Sciences, Mathematics, Combinatorics +9
1–5 of 10