Alexandr V. Kostochka

	2012
129		Saieed Akbari, Jaehoon Kim, Alexandr V. Kostochka: Harmonious Coloring of Trees with Large Maximum Degree CoRR abs/1202.1046: (2012)
128		Saieed Akbari, Jaehoon Kim, Alexandr V. Kostochka: Harmonious coloring of trees with large maximum degree. Discrete Mathematics 312(10): 1633-1637 (2012)
127		Noga Alon, Alexandr V. Kostochka: Dense uniform hypergraphs have high list chromatic number. Discrete Mathematics 312(14): 2119-2125 (2012)
126		Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé: A stability theorem on fractional covering of triangles by edges. Eur. J. Comb. 33(5): 799-806 (2012)
	2011
125		Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason: Minors in Graphs with High Chromatic Number. Combinatorics, Probability & Computing 20(4): 513-518 (2011)
124		Alexandr V. Kostochka, Michael Stiebitz, Douglas R. Woodall: Ohba's conjecture for graphs with independence number five. Discrete Mathematics 311(12): 996-1005 (2011)
123		József Balogh, Alexandr V. Kostochka: Large minors in graphs with given independence number. Discrete Mathematics 311(20): 2203-2215 (2011)
122		Noga Alon, Alexandr V. Kostochka: Hypergraph list coloring and Euclidean Ramsey theory. Random Struct. Algorithms 39(3): 377-390 (2011)
	2010
121		Henry A. Kierstead, Alexandr V. Kostochka: Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture. Combinatorica 30(2): 201-216 (2010)
120		Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi: A fast algorithm for equitable coloring. Combinatorica 30(2): 217-224 (2010)
119		Alexandr V. Kostochka, Noah Prince: Dense graphs have K3, t minors. Discrete Mathematics 310(20): 2637-2654 (2010)
118		Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason: Hadwiger numbers and over-dominating colourings. Discrete Mathematics 310(20): 2662-2665 (2010)
117		Alexandr V. Kostochka, Pavel Pudlák, Vojtech Rödl: Some constructive bounds on Ramsey numbers. J. Comb. Theory, Ser. B 100(5): 439-445 (2010)
116		Alexandr V. Kostochka, Daniel Král', Jean-Sébastien Sereni, Michael Stiebitz: Graphs with bounded tree-width and large odd-girth are almost bipartite. J. Comb. Theory, Ser. B 100(6): 554-559 (2010)
115		Alexandr V. Kostochka: On Ks, t minors in (s+t)-chromatic graphs. Journal of Graph Theory 65(4): 343-350 (2010)
114		Alexandr V. Kostochka, Vojtech Rödl: Constructions of sparse uniform hypergraphs with high chromatic number. Random Struct. Algorithms 36(1): 46-56 (2010)
	2009
113		Noga Alon, József Balogh, Alexandr V. Kostochka, Wojciech Samotij: Sizes of Induced Subgraphs of Ramsey Graphs. Combinatorics, Probability & Computing 18(4): 459-476 (2009)
112		Hal A. Kierstead, Alexandr V. Kostochka: Efficient Graph Packing via Game Colouring. Combinatorics, Probability & Computing 18(5): 765-774 (2009)
111		Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka, Naeem N. Sheikh: Planar graphs decomposable into a forest and a matching. Discrete Mathematics 309(1): 277-279 (2009)
110		József Balogh, Alexandr V. Kostochka, Noah Prince, Michael Stiebitz: The Erdos-Lovász Tihany conjecture for quasi-line graphs. Discrete Mathematics 309(12): 3985-3991 (2009)
109		Alexandr V. Kostochka, Gexin Yu: Ore-type conditions implying 2-factors consisting of short cycles. Discrete Mathematics 309(14): 4762-4771 (2009)
108		Alexandr V. Kostochka, Lale Özkahya, Douglas R. Woodall: A Brooks-type bound for squares of K4-minor-free graphs. Discrete Mathematics 309(23-24): 6572-6584 (2009)
107		Thomas Böhme, Alexandr V. Kostochka: Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density. Discrete Mathematics 309(4): 997-1000 (2009)
106		Alexandr V. Kostochka, B. Y. Stodolsky: An upper bound on the domination number of n-vertex connected cubic graphs. Discrete Mathematics 309(5): 1142-1162 (2009)
105		Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka, Naeem N. Sheikh: Decompositions of quadrangle-free planar graphs. Discussiones Mathematicae Graph Theory 29(1): 87-99 (2009)
104		Hal A. Kierstead, Alexandr V. Kostochka: Ore-type versions of Brooks' theorem. J. Comb. Theory, Ser. B 99(2): 298-305 (2009)
103		Oleg V. Borodin, Alexandr V. Kostochka, Naeem N. Sheikh, Gexin Yu: M-degrees of quadrangle-free planar graphs. Journal of Graph Theory 60(1): 80-85 (2009)
102		Noga Alon, Alexandr V. Kostochka: Induced subgraphs with distinct sizes. Random Struct. Algorithms 34(1): 45-53 (2009)
101		Alexandr V. Kostochka, Mohit Kumbhat: Coloring uniform hypergraphs with few edges. Random Struct. Algorithms 35(3): 348-368 (2009)
	2008
100		Hemanshu Kaul, Alexandr V. Kostochka, Gexin Yu: On a graph packing conjecture by Bollobás, Eldridge and Catlin. Combinatorica 28(4): 469-485 (2008)
99		Hal A. Kierstead, Alexandr V. Kostochka: A Short Proof of the Hajnal-Szemerédi Theorem on Equitable Colouring. Combinatorics, Probability & Computing 17(2): 265-270 (2008)
98		Alexandr V. Kostochka, Dhruv Mubayi: When is an Almost Monochromatic K4 Guaranteed? Combinatorics, Probability & Computing 17(6): 823-830 (2008)
97		Alexandr V. Kostochka, Gexin Yu: Minimum degree conditions for H-linked graphs. Discrete Applied Mathematics 156(9): 1542-1548 (2008)
96		Alexandr V. Kostochka, Noah Prince: On Ks, t-minors in graphs with given average degree. Discrete Mathematics 308(19): 4435-4445 (2008)
95		Alexandr V. Kostochka, Michael Stiebitz: Partitions and Edge Colourings of Multigraphs. Electr. J. Comb. 15(1): (2008)
94		Oleg V. Borodin, Alexandr V. Kostochka, Naeem N. Sheikh, Gexin Yu: Decomposing a planar graph with girth 9 into a forest and a matching. Eur. J. Comb. 29(5): 1235-1241 (2008)
93		József Balogh, Alexandr V. Kostochka: On 2-Detour Subgraphs of the Hypercube. Graphs and Combinatorics 24(4): 265-272 (2008)
92		L. Sunil Chandran, Alexandr V. Kostochka, J. Krishnam Raju: Hadwiger Number and the Cartesian Product of Graphs. Graphs and Combinatorics 24(4): 291-301 (2008)
91		Hal A. Kierstead, Alexandr V. Kostochka: An Ore-type theorem on equitable coloring. J. Comb. Theory, Ser. B 98(1): 226-234 (2008)
90		Béla Bollobás, Alexandr V. Kostochka, Kittikorn Nakprasit: Packing d-degenerate graphs. J. Comb. Theory, Ser. B 98(1): 85-94 (2008)
89		Alexandr V. Kostochka, Gexin Yu: Packing of graphs with small product of sizes. J. Comb. Theory, Ser. B 98(6): 1411-1415 (2008)
88		Nana Arizumi, Peter Hamburger, Alexandr V. Kostochka: On k-detour subgraphs of hypercubes. Journal of Graph Theory 57(1): 55-64 (2008)
87		Alexandr V. Kostochka, Gexin Yu: Ore-type degree conditions for a graph to be H-linked. Journal of Graph Theory 58(1): 14-26 (2008)
86		Alexandr V. Kostochka, Xuding Zhu: Adapted List Coloring of Graphs and Hypergraphs. SIAM J. Discrete Math. 22(1): 398-408 (2008)
	2007
85		Alexandr V. Kostochka, Gexin Yu: Ore-type graph packing problems. Combinatorics, Probability & Computing 16(1): 167-169 (2007)
84		Hemanshu Kaul, Alexandr V. Kostochka: Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer. Combinatorics, Probability & Computing 16(3): 409-416 (2007)
83		Peter Hamburger, Penny E. Haxell, Alexandr V. Kostochka: On Directed Triangles in Digraphs. Electr. J. Comb. 14(1): (2007)
82		Nancy Eaton, Zoltán Füredi, Alexandr V. Kostochka, Jozef Skokan: Tree representations of graphs. Eur. J. Comb. 28(4): 1087-1098 (2007)
81		Alexandr V. Kostochka, Gexin Yu: An Ore-type analogue of the Sauer-Spencer Theorem. Graphs and Combinatorics 23(4): 419-424 (2007)
	2006
80		Ken-ichi Kawarabayashi, Alexandr V. Kostochka, Gexin Yu: On Sufficient Degree Conditions for a Graph to be k-linked. Combinatorics, Probability & Computing 15(5): 685-694 (2006)
79		Alexandr V. Kostochka, Douglas B. West: Chvátal's Condition cannot hold for both a graph and its complement. Discussiones Mathematicae Graph Theory 26(1): 73-76 (2006)
78		Alexandr V. Kostochka, Vojtech Rödl: On Ramsey numbers of uniform hypergraphs with given maximum degree. J. Comb. Theory, Ser. A 113(7): 1555-1564 (2006)
77		Noga Alon, Graham Brightwell, Hal A. Kierstead, Alexandr V. Kostochka, Peter Winkler: Dominating sets in k-majority tournaments. J. Comb. Theory, Ser. B 96(3): 374-387 (2006)
76		Ronald J. Gould, Alexandr V. Kostochka, Gexin Yu: On Minimum Degree Implying That a Graph is H-Linked. SIAM J. Discrete Math. 20(4): 829-840 (2006)
	2005
75		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)
74		Alexandr V. Kostochka, B. Y. Stodolsky: On domination in connected cubic graphs. Discrete Mathematics 304(1-3): 45-50 (2005)
73		Alexandr V. Kostochka, Gexin Yu: Minimum degree conditions for H-linked graphs. Electronic Notes in Discrete Mathematics 21: 331 (2005)
72		Thomas Böhme, Alexandr V. Kostochka: Disjoint Kr-minors in large graphs with given average degree. Eur. J. Comb. 26(3-4): 289-292 (2005)
71		Alexandr V. Kostochka, Douglas R. Woodall: Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders. Eur. J. Comb. 26(7): 1119-1138 (2005)
70		Alexandr V. Kostochka, Jacques Verstraëte: Even cycles in hypergraphs. J. Comb. Theory, Ser. B 94(1): 173-182 (2005)
69		Zoltán Füredi, Alexandr V. Kostochka, Riste Skrekovski, Michael Stiebitz, Douglas B. West: Nordhaus-Gaddum-type Theorems for decompositions into many parts. Journal of Graph Theory 50(4): 273-292 (2005)
68		Alexandr V. Kostochka, Gexin Yu: An extremal problem for H-linked graphs. Journal of Graph Theory 50(4): 321-339 (2005)
67		Alexandr V. Kostochka, Kittikorn Nakprasit, Sriram V. Pemmaraju: On Equitable Coloring of d-Degenerate Graphs. SIAM J. Discrete Math. 19(1): 83-95 (2005)
66		Alexandr V. Kostochka, Kittikorn Nakprasit: On equitable Delta-coloring of graphs with low average degree. Theor. Comput. Sci. 349(1): 82-91 (2005)
	2004
65		Alexandr V. Kostochka, Vojtech Rödl: On Graphs With Small Ramsey Numbers, II. Combinatorica 24(3): 389-401 (2004)
64		Seog-Jin Kim, Alexandr V. Kostochka, Kittikorn Nakprasit: On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane. Electr. J. Comb. 11(1): (2004)
63		Oleg V. Borodin, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West: Homomorphisms from sparse graphs with large girth. J. Comb. Theory, Ser. B 90(1): 147-159 (2004)
62		Paul N. Balister, Alexandr V. Kostochka, Hao Li, Richard H. Schelp: Balanced edge colorings. J. Comb. Theory, Ser. B 90(1): 3-20 (2004)
61		Alexandr V. Kostochka: Coloring uniform hypergraphs with few colors. Random Struct. Algorithms 24(1): 1-10 (2004)
60		Michael O. Albertson, Alexandr V. Kostochka, Douglas B. West: Precoloring Extensions of Brooks' Theorem. SIAM J. Discrete Math. 18(3): 542-553 (2004)
	2003
59		Sriram V. Pemmaraju, Kittikorn Nakprasit, Alexandr V. Kostochka: Equitable colorings with constant number of colors. SODA 2003: 458-459
58		Alexandr V. Kostochka, Kittikorn Nakprasit: Equitable Colourings Of D-Degenerate Graphs. Combinatorics, Probability & Computing 12(1): 53-60 (2003)
57		Alexandr V. Kostochka, Benny Sudakov: On Ramsey Numbers of Sparse Graphs. Combinatorics, Probability & Computing 12(5-6): 627-641 (2003)
56		Alexandr V. Kostochka, Michael Stiebitz: A new lower bound on the number of edges in colour-critical graphs and hypergraphs. J. Comb. Theory, Ser. B 87(2): 374-402 (2003)
55		Alexandr V. Kostochka, Vladimir A. Tashkinov: Decomposing Graphs into Long Paths. Order 20(3): 239-253 (2003)
	2002
54		Alexandr V. Kostochka: Transversals in Uniform Hypergraphs with Property (p, 2). Combinatorica 22(2): 275-285 (2002)
53		Alexandr V. Kostochka: Equitable colorings of outerplanar graphs. Discrete Mathematics 258(1-3): 373-377 (2002)
52		Alexandr V. Kostochka: On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs. Electr. J. Comb. 9(1): (2002)
51		Alexandr V. Kostochka, Jaroslav Nesetril: Colouring Relatives of Intervals on the Plane, II: Intervals and Rays in Two Directions. Eur. J. Comb. 23(1): 37-41 (2002)
50		Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena: Nilpotent Families of Endomorphisms of (p(V)+, cup). J. Comb. Theory, Ser. B 86(1): 100-108 (2002)
	2001
49		Alexandr V. Kostochka, Douglas R. Woodall: Density Conditions for Panchromatic Colourings of Hypergraphs. Combinatorica 21(4): 515-541 (2001)
48		Oleg V. Borodin, Alexandr V. Kostochka, André Raspaud, Eric Sopena: Acyclic colouring of 1-planar graphs. Discrete Applied Mathematics 114(1-3): 29-41 (2001)
47		Alexandr V. Kostochka, Douglas R. Woodall: Sparse sets in the complements of graphs with given girth. Discrete Mathematics 233(1-3): 163-174 (2001)
46		Alexandr V. Kostochka, Jaroslav Nesetril, P. Smolíková: Colorings and homomorphisms of degenerate and bounded degree graphs. Discrete Mathematics 233(1-3): 257-276 (2001)
45		Pavol Hell, Alexandr V. Kostochka, André Raspaud, Eric Sopena: On nice graphs. Discrete Mathematics 234(1-3): 39-51 (2001)
44		Alexandr V. Kostochka, Douglas R. Woodall: Choosability conjectures and multicircuits. Discrete Mathematics 240(1-3): 123-143 (2001)
43		Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Eric Sopena: On Deeply Critical Oriented Graphs. J. Comb. Theory, Ser. B 81(1): 150-155 (2001)
42		Alexandr V. Kostochka, Dhruv Mubayi, Vojtech Rödl, Prasad Tetali: On the chromatic number of set systems. Random Struct. Algorithms 19(2): 87-98 (2001)
	2000
41		Alexandr V. Kostochka, Michael Stiebitz: On the Number of Edges in Colour-Critical Graphs and Hypergraphs. Combinatorica 20(4): 521-530 (2000)
40		Walter A. Deuber, Alexandr V. Kostochka: On degrees of vertices in paradoxical trees. Discrete Mathematics 212(1-2): 53-59 (2000)
39		Gregory Gutin, Alexandr V. Kostochka, Bjarne Toft: On the Hajo's number of graphs. Discrete Mathematics 213(1-3): 153-161 (2000)
38		Oleg V. Borodin, Alexandr V. Kostochka, Bjarne Toft: Variable degeneracy: extensions of Brooks' and Gallai's theorems. Discrete Mathematics 214(1-3): 101-112 (2000)
37		Alexandr V. Kostochka, Irina G. Perepelitsa: Colouring triangle-free intersection graphs of boxes on the plane. Discrete Mathematics 220(1-3): 243-249 (2000)
36		Alexandr V. Kostochka, Douglas R. Woodall: On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings. Eur. J. Comb. 21(2): 249-255 (2000)
35		Béla Bollobás, Alexandr V. Kostochka, Richard H. Schelp: Local and Mean Ramsey Numbers for Trees. J. Comb. Theory, Ser. B 79(1): 100-103 (2000)
34		Alexander A. Ageev, Alexandr V. Kostochka: Vertex Set Partitions Preserving Conservativeness. J. Comb. Theory, Ser. B 80(2): 202-217 (2000)
	1999
33		Alexandr V. Kostochka, Jaroslav Nesetril: Properties Of Descartes' Construction Of Triangle-Free Graphs With High Chromatic Number. Combinatorics, Probability & Computing 8(5): 467-472 (1999)
32		Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena: On the maximum average degree and the oriented chromatic number of a graph. Discrete Mathematics 206(1-3): 77-89 (1999)
31		Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Douglas R. Woodall: Transversals in uniform hypergraphs with property (7, 2). Discrete Mathematics 207(1-3): 277-284 (1999)
30		Noga Alon, Peter Hamburger, Alexandr V. Kostochka: Regular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs. Eur. J. Comb. 20(6): 469-481 (1999)
	1998
29		Alexandr V. Kostochka, Vojtech Rödl: On Large Systems of Sets with No Large Weak <Delta>-subsystems. Combinatorica 18(2): 235-240 (1998)
28		N. I. Glebov, Alexandr V. Kostochka: On the independent domination number of graphs with given minimum degree. Discrete Mathematics 188(1-3): 261-266 (1998)
27		Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena: On universal graphs for planar oriented graphs of a given girth. Discrete Mathematics 188(1-3): 73-85 (1998)
26		Alexandr V. Kostochka, Michael Stiebitz: Colour-critical graphs with few edges. Discrete Mathematics 191(1-3): 125-137 (1998)
25		Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall: On kernel-perfect orientations of line graphs. Discrete Mathematics 191(1-3): 45-49 (1998)
24		Alexandr V. Kostochka, Jaroslav Nesetril: Coloring Relatives of Intervals on the Plane, I: Chromatic Number Versus Girth. Eur. J. Comb. 19(1): 103-110 (1998)
23		Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall: Total Colourings of Planar Graphs with Large Girth. Eur. J. Comb. 19(1): 19-24 (1998)
22		Alexandr V. Kostochka, Vojtech Rödl: Partial Steiner systems and matchings in hypergraphs. Random Struct. Algorithms 13(3-4): 335-347 (1998)
	1997
21		Ervin Györi, Alexandr V. Kostochka, Tomasz Luczak: Graphs without short odd cycles are nearly bipartite. Discrete Mathematics 163(1-3): 279-284 (1997)
20		Alexandr V. Kostochka, Jan Kratochvíl: Covering and coloring polygon-circle graphs. Discrete Mathematics 163(1-3): 299-305 (1997)
19		Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz: Spanning trees with pairwise nonadjacent endvertices. Discrete Mathematics 170(1-3): 219-222 (1997)
18		Walter A. Deuber, Paul Erdös, David S. Gunderson, Alexandr V. Kostochka, A. G. Meyer: Intersection Statements for Systems of Sets. J. Comb. Theory, Ser. A 79(1): 118-132 (1997)
17		Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall: List Edge and List Total Colourings of Multigraphs. J. Comb. Theory, Ser. B 71(2): 184-204 (1997)
	1996
16		Alexandr V. Kostochka: The total chromatic number of any multigraph with maximum degree five is at most seven. Discrete Mathematics 162(1-3): 199-214 (1996)
15		Alexandr V. Kostochka, Michael Stiebitz, B. Wirth: The colour theorems of Brooks and Gallai extended. Discrete Mathematics 162(1-3): 299-303 (1996)
14		Alexandr V. Kostochka: An intersection theorem for systems of sets. Random Struct. Algorithms 9(1-2): 213-221 (1996)
	1995
13		Alexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti: A Characterization of Seymour Graphs. IPCO 1995: 364-372
12		Maria Axenovich, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka: On set systems without weak 3-Delta-subsystems. Discrete Mathematics 138(1-3): 57-62 (1995)
11		Alexandr V. Kostochka: The Number of Spanning Trees in Graphs with Given Degree Sequence. Random Struct. Algorithms 6(2/3): 269-274 (1995)
	1993
10		Dmitry Fon-Der-Flaass, Alexandr V. Kostochka: Covering boxes by points. Discrete Mathematics 120(1-3): 269-275 (1993)
9		Alexandr V. Kostochka: The independent domination number of a cubic 3-connected graph can be much larger than its domination number. Graphs and Combinatorics 9(2-4): 235-237 (1993)
8		Alexandr V. Kostochka, Alexander A. Sapozhenko, K. Weber: Radius and Diameter of Random Subgraphs of the Hypercube. Random Struct. Algorithms 4(2): 215-230 (1993)
	1992
7		Alexandr V. Kostochka: List edge chromatic number of graphs with large girth. Discrete Mathematics 101(1-3): 189-201 (1992)
	1990
6		Alexandr V. Kostochka: Matchings in Random Spanning Subgraphs of Cubelike Graphs. Random Struct. Algorithms 1(3): 277-286 (1990)
	1988
5		Alexandr V. Kostochka, László Pyber: Samll topological complete subgraphs of "dense" graphs. Combinatorica 8(1): 83-86 (1988)
	1985
4		Alexandr V. Kostochka: Maximum set of edges no two covered by a clique. Combinatorica 5(3): 229-236 (1985)
	1984
3		Alexandr V. Kostochka: Lower bound of the Hadwiger number of graphs by their average degree. Combinatorica 4(4): 307-316 (1984)
	1982
2		Alexandr V. Kostochka: A class of constructions for Turán's (3, 4) problem. Combinatorica 2(2): 187-192 (1982)
	1977
1		Oleg V. Borodin, Alexandr V. Kostochka: On an upper bound of a graph's chromatic number, depending on the graph's degree and density. J. Comb. Theory, Ser. B 23(2-3): 247-250 (1977)

Coauthor Index

1	Alexander A. Ageev	[13] [34]
2	Saieed Akbari	[128] [129]
3	Michael O. Albertson	[60]
4	Noga Alon	[30] [77] [102] [113] [122] [127]
5	Nana Arizumi	[88]
6	Maria Axenovich	[12]
7	Paul N. Balister (Paul Balister)	[62]
8	József Balogh	[93] [110] [113] [123]
9	Thomas Böhme	[19] [72] [107] [118] [125]
10	Béla Bollobás	[35] [90]
11	Oleg V. Borodin	[1] [17] [23] [25] [27] [32] [38] [43] [48] [63] [94] [103] [105] [111]
12	Graham Brightwell	[77]
13	Hajo Broersma (H. J. Broersma)	[19]
14	L. Sunil Chandran	[92]
15	Walter A. Deuber	[18] [40]
16	Nancy Eaton	[82]
17	Paul Erdös	[18]
18	Dmitry Fon-Der-Flaass	[10] [12] [31] [43] [50]
19	Zoltán Füredi	[69] [82]
20	Alexei N. Glebov	[75]
21	N. I. Glebov	[28]
22	F. Göbel	[19]
23	Ronald J. Gould	[76]
24	David S. Gunderson	[18]
25	Gregory Gutin	[39]
26	Ervin Györi	[21]
27	Peter Hamburger	[30] [83] [88]
28	Penny E. Haxell	[83] [126]
29	Pavol Hell	[45]
30	Anna O. Ivanova	[105] [111]
31	Hemanshu Kaul	[84] [100]
32	Ken-ichi Kawarabayashi	[80]
33	Hal A. Kierstead (Henry A. Kierstead)	[77] [91] [99] [104] [112] [120] [121]
34	Jaehoon Kim	[128] [129]
35	Seog-Jin Kim	[63] [64]
36	Daniel Král (Daniel Král')	[116]
37	Jan Kratochvíl	[20]
38	Mohit Kumbhat	[101]
39	Hao Li	[62]
40	Tomasz Luczak	[21]
41	A. G. Meyer	[18]
42	Dhruv Mubayi	[42] [98]
43	Marcelo Mydlarz	[120]
44	Kittikorn Nakprasit	[58] [59] [64] [66] [67] [90]
45	Jaroslav Nesetril (Jarik Nesetril)	[24] [27] [32] [33] [46] [50] [51]
46	Lale Özkahya	[108]
47	Sriram V. Pemmaraju	[59] [67]
48	Irina G. Perepelitsa	[37]
49	Noah Prince	[96] [110] [119]
50	Pavel Pudlák	[117]
51	László Pyber	[5]
52	J. Krishnam Raju	[92]
53	André Raspaud	[27] [32] [43] [45] [48] [50]
54	Vojtech Rödl	[22] [29] [42] [65] [78] [114] [117]
55	Wojciech Samotij	[113]
56	Alexander A. Sapozhenko	[8]
57	Richard H. Schelp	[35] [62]
58	Jean-Sébastien Sereni	[116]
59	Naeem N. Sheikh	[94] [103] [105] [111]
60	Jozef Skokan	[82]
61	Riste Skrekovski	[69]
62	P. Smolíková	[46]
63	Eric Sopena	[27] [32] [43] [45] [48] [50]
64	Michael Stiebitz	[15] [19] [26] [41] [56] [69] [95] [110] [116] [124]
65	B. Y. Stodolsky	[74] [106]
66	Benny Sudakov	[57]
67	Endre Szemerédi	[120]
68	Zoltán Szigeti	[13]
69	Vladimir A. Tashkinov	[55] [75]
70	Prasad Tetali	[42]
71	Andrew Thomason	[118] [125]
72	Stéphan Thomassé	[126]
73	Bjarne Toft	[38] [39]
74	Jacques Verstraëte	[70]
75	K. Weber	[8]
76	Douglas B. West	[60] [63] [69] [79]
77	Peter Winkler (Peter M. Winkler)	[77]
78	B. Wirth	[15]
79	Douglas R. Woodall	[17] [23] [25] [31] [36] [44] [47] [49] [71] [108] [124]
80	Gexin Yu	[68] [73] [76] [80] [81] [85] [87] [89] [94] [97] [100] [103] [109]
81	Xuding Zhu	[86]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page