Alexei N. Glebov

	2011
6		Oleg V. Borodin, Alexei N. Glebov: Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable. Journal of Graph Theory 66(1): 1-31 (2011)
	2010
5		Oleg V. Borodin, Alexei N. Glebov, André Raspaud: Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable. Discrete Mathematics 310(20): 2584-2594 (2010)
	2009
4		Oleg V. Borodin, Alexei N. Glebov, Mickaël Montassier, André Raspaud: Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable. J. Comb. Theory, Ser. B 99(4): 668-673 (2009)
	2007
3		Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, J. van den Heuvel: A new upper bound on the cyclic chromatic number. Journal of Graph Theory 54(1): 58-72 (2007)
	2005
2		Alexei N. Glebov, Alexandr V. Kostochka, Vladimir A. Tashkinov: Smaller planar triangle-free graphs that are not 3-list-colorable. Discrete Mathematics 290(2/3): 269-274 (2005)
1		Oleg V. Borodin, Alexei N. Glebov, André Raspaud, Mohammad R. Salavatipour: Planar graphs without cycles of length from 4 to 7 are 3-colorable. J. Comb. Theory, Ser. B 93(2): 303-311 (2005)

Coauthor Index

1	Oleg V. Borodin	[1] [3] [4] [5] [6]
2	Hajo Broersma (H. J. Broersma)	[3]
3	J. van den Heuvel	[3]
4	Alexandr V. Kostochka	[2]
5	Mickaël Montassier	[4]
6	André Raspaud	[1] [4] [5]
7	Mohammad R. Salavatipour	[1]
8	Vladimir A. Tashkinov	[2]

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page