dblp.uni-trier.dewww.uni-trier.de

Alexandr V. Kostochka Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
98EEOleg 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)
97EEHal A. Kierstead, Alexandr V. Kostochka: Ore-type versions of Brooks' theorem. J. Comb. Theory, Ser. B 99(2): 298-305 (2009)
96EEOleg 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)
95EENoga Alon, Alexandr V. Kostochka: Induced subgraphs with distinct sizes. Random Struct. Algorithms 34(1): 45-53 (2009)
2008
94EEHemanshu Kaul, Alexandr V. Kostochka, Gexin Yu: On a graph packing conjecture by Bollobás, Eldridge and Catlin. Combinatorica 28(4): 469-485 (2008)
93EEHal 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)
92EEAlexandr V. Kostochka, Dhruv Mubayi: When is an Almost Monochromatic K4 Guaranteed? Combinatorics, Probability & Computing 17(6): 823-830 (2008)
91EEAlexandr V. Kostochka, Gexin Yu: Minimum degree conditions for H-linked graphs. Discrete Applied Mathematics 156(9): 1542-1548 (2008)
90EEAlexandr V. Kostochka, Noah Prince: On Ks, t-minors in graphs with given average degree. Discrete Mathematics 308(19): 4435-4445 (2008)
89EEOleg 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)
88EEHal A. Kierstead, Alexandr V. Kostochka: An Ore-type theorem on equitable coloring. J. Comb. Theory, Ser. B 98(1): 226-234 (2008)
87EEBéla Bollobás, Alexandr V. Kostochka, Kittikorn Nakprasit: Packing d-degenerate graphs. J. Comb. Theory, Ser. B 98(1): 85-94 (2008)
86EEAlexandr V. Kostochka, Gexin Yu: Packing of graphs with small product of sizes. J. Comb. Theory, Ser. B 98(6): 1411-1415 (2008)
85EENana Arizumi, Peter Hamburger, Alexandr V. Kostochka: On k-detour subgraphs of hypercubes. Journal of Graph Theory 57(1): 55-64 (2008)
84EEAlexandr V. Kostochka, Gexin Yu: Ore-type degree conditions for a graph to be H-linked. Journal of Graph Theory 58(1): 14-26 (2008)
83EEAlexandr V. Kostochka, Xuding Zhu: Adapted List Coloring of Graphs and Hypergraphs. SIAM J. Discrete Math. 22(1): 398-408 (2008)
2007
82EEAlexandr V. Kostochka, Gexin Yu: Ore-type graph packing problems. Combinatorics, Probability & Computing 16(1): 167-169 (2007)
81EEHemanshu Kaul, Alexandr V. Kostochka: Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer. Combinatorics, Probability & Computing 16(3): 409-416 (2007)
80EEPeter Hamburger, Penny E. Haxell, Alexandr V. Kostochka: On Directed Triangles in Digraphs. Electr. J. Comb. 14(1): (2007)
79EENancy Eaton, Zoltán Füredi, Alexandr V. Kostochka, Jozef Skokan: Tree representations of graphs. Eur. J. Comb. 28(4): 1087-1098 (2007)
2006
78EEKen-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)
77EEAlexandr 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)
76EENoga 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)
75EERonald 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
74EEAlexei 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)
73EEAlexandr V. Kostochka, B. Y. Stodolsky: On domination in connected cubic graphs. Discrete Mathematics 304(1-3): 45-50 (2005)
72EEAlexandr V. Kostochka, Gexin Yu: Minimum degree conditions for H-linked graphs. Electronic Notes in Discrete Mathematics 21: 331 (2005)
71EEThomas Böhme, Alexandr V. Kostochka: Disjoint Kr-minors in large graphs with given average degree. Eur. J. Comb. 26(3-4): 289-292 (2005)
70EEAlexandr V. Kostochka, Douglas R. Woodall: Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders. Eur. J. Comb. 26(7): 1119-1138 (2005)
69EEAlexandr V. Kostochka, Jacques Verstraëte: Even cycles in hypergraphs. J. Comb. Theory, Ser. B 94(1): 173-182 (2005)
68EEZoltá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)
67EEAlexandr V. Kostochka, Gexin Yu: An extremal problem for H-linked graphs. Journal of Graph Theory 50(4): 321-339 (2005)
66EEAlexandr V. Kostochka, Kittikorn Nakprasit, Sriram V. Pemmaraju: On Equitable Coloring of d-Degenerate Graphs. SIAM J. Discrete Math. 19(1): 83-95 (2005)
65EEAlexandr V. Kostochka, Kittikorn Nakprasit: On equitable Delta-coloring of graphs with low average degree. Theor. Comput. Sci. 349(1): 82-91 (2005)
2004
64EEAlexandr V. Kostochka, Vojtech Rödl: On Graphs With Small Ramsey Numbers, II. Combinatorica 24(3): 389-401 (2004)
63EESeog-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)
62EEOleg 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)
61EEPaul N. Balister, Alexandr V. Kostochka, Hao Li, Richard H. Schelp: Balanced edge colorings. J. Comb. Theory, Ser. B 90(1): 3-20 (2004)
60EEAlexandr V. Kostochka: Coloring uniform hypergraphs with few colors. Random Struct. Algorithms 24(1): 1-10 (2004)
59EEMichael O. Albertson, Alexandr V. Kostochka, Douglas B. West: Precoloring Extensions of Brooks' Theorem. SIAM J. Discrete Math. 18(3): 542-553 (2004)
2003
58EESriram V. Pemmaraju, Kittikorn Nakprasit, Alexandr V. Kostochka: Equitable colorings with constant number of colors. SODA 2003: 458-459
57 Alexandr V. Kostochka, Kittikorn Nakprasit: Equitable Colourings Of D-Degenerate Graphs. Combinatorics, Probability & Computing 12(1): (2003)
56 Alexandr V. Kostochka, Benny Sudakov: On Ramsey Numbers of Sparse Graphs. Combinatorics, Probability & Computing 12(5-6): 627-641 (2003)
55EEAlexandr 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)
54EEAlexandr V. Kostochka, Vladimir A. Tashkinov: Decomposing Graphs into Long Paths. Order 20(3): 239-253 (2003)
2002
53EEAlexandr V. Kostochka: Transversals in Uniform Hypergraphs with Property (p, 2). Combinatorica 22(2): 275-285 (2002)
52EEAlexandr V. Kostochka: Equitable colorings of outerplanar graphs. Discrete Mathematics 258(1-3): 373-377 (2002)
51EEAlexandr V. Kostochka: On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs. Electr. J. Comb. 9(1): (2002)
50EEAlexandr 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)
49EEDmitry 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
48EEAlexandr V. Kostochka, Douglas R. Woodall: Density Conditions for Panchromatic Colourings of Hypergraphs. Combinatorica 21(4): 515-541 (2001)
47 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)
46EEAlexandr V. Kostochka, Douglas R. Woodall: Sparse sets in the complements of graphs with given girth. Discrete Mathematics 233(1-3): 163-174 (2001)
45EEAlexandr V. Kostochka, Jaroslav Nesetril, P. Smolíková: Colorings and homomorphisms of degenerate and bounded degree graphs. Discrete Mathematics 233(1-3): 257-276 (2001)
44EEPavol Hell, Alexandr V. Kostochka, André Raspaud, Eric Sopena: On nice graphs. Discrete Mathematics 234(1-3): 39-51 (2001)
43EEAlexandr V. Kostochka, Douglas R. Woodall: Choosability conjectures and multicircuits. Discrete Mathematics 240(1-3): 123-143 (2001)
42EEOleg 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)
41 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
40EEAlexandr V. Kostochka, Michael Stiebitz: On the Number of Edges in Colour-Critical Graphs and Hypergraphs. Combinatorica 20(4): 521-530 (2000)
39EEWalter A. Deuber, Alexandr V. Kostochka: On degrees of vertices in paradoxical trees. Discrete Mathematics 212(1-2): 53-59 (2000)
38EEGregory Gutin, Alexandr V. Kostochka, Bjarne Toft: On the Hajo's number of graphs. Discrete Mathematics 213(1-3): 153-161 (2000)
37EEOleg V. Borodin, Alexandr V. Kostochka, Bjarne Toft: Variable degeneracy: extensions of Brooks' and Gallai's theorems. Discrete Mathematics 214(1-3): 101-112 (2000)
36EEAlexandr V. Kostochka, Irina G. Perepelitsa: Colouring triangle-free intersection graphs of boxes on the plane. Discrete Mathematics 220(1-3): 243-249 (2000)
35EEAlexandr 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)
34EEBé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)
33EEAlexander A. Ageev, Alexandr V. Kostochka: Vertex Set Partitions Preserving Conservativeness. J. Comb. Theory, Ser. B 80(2): 202-217 (2000)
1999
32 Alexandr V. Kostochka, Jaroslav Nesetril: Properties Of Descartes' Construction Of Triangle-Free Graphs With High Chromatic Number. Combinatorics, Probability & Computing 8(5): (1999)
31EEOleg 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)
30EEDmitry 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)
29EENoga 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
28EEAlexandr V. Kostochka, Vojtech Rödl: On Large Systems of Sets with No Large Weak <Delta>-subsystems. Combinatorica 18(2): 235-240 (1998)
27EEN. I. Glebov, Alexandr V. Kostochka: On the independent domination number of graphs with given minimum degree. Discrete Mathematics 188(1-3): 261-266 (1998)
26EEOleg 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)
25EEAlexandr V. Kostochka, Michael Stiebitz: Colour-critical graphs with few edges. Discrete Mathematics 191(1-3): 125-137 (1998)
24EEOleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall: On kernel-perfect orientations of line graphs. Discrete Mathematics 191(1-3): 45-49 (1998)
23EEAlexandr V. Kostochka, Jaroslav Nesetril: Coloring Relatives of Intervals on the Plane, I: Chromatic Number Versus Girth. Eur. J. Comb. 19(1): 103-110 (1998)
22EEOleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall: Total Colourings of Planar Graphs with Large Girth. Eur. J. Comb. 19(1): 19-24 (1998)
21 Alexandr V. Kostochka, Vojtech Rödl: Partial Steiner systems and matchings in hypergraphs. Random Struct. Algorithms 13(3-4): 335-347 (1998)
1997
20EEErvin Györi, Alexandr V. Kostochka, Tomasz Luczak: Graphs without short odd cycles are nearly bipartite. Discrete Mathematics 163(1-3): 279-284 (1997)
19EEAlexandr V. Kostochka, Jan Kratochvíl: Covering and coloring polygon-circle graphs. Discrete Mathematics 163(1-3): 299-305 (1997)
18EEThomas 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)
17EEWalter 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)
16EEOleg 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
15EEAlexandr 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)
14EEAlexandr V. Kostochka, Michael Stiebitz, B. Wirth: The colour theorems of Brooks and Gallai extended. Discrete Mathematics 162(1-3): 299-303 (1996)
13 Alexandr V. Kostochka: An intersection theorem for systems of sets. Random Struct. Algorithms 9(1-2): 213-221 (1996)
1995
12EEAlexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti: A Characterization of Seymour Graphs. IPCO 1995: 364-372
11EEMaria Axenovich, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka: On set systems without weak 3-Delta-subsystems. Discrete Mathematics 138(1-3): 57-62 (1995)
10 Alexandr V. Kostochka: The Number of Spanning Trees in Graphs with Given Degree Sequence. Random Struct. Algorithms 6(2/3): 269-274 (1995)
1993
9EEDmitry Fon-Der-Flaass, Alexandr V. Kostochka: Covering boxes by points. Discrete Mathematics 120(1-3): 269-275 (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
7EEAlexandr 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
1EEOleg 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

1Alexander A. Ageev [12] [33]
2Michael O. Albertson [59]
3Noga Alon [29] [76] [95]
4Nana Arizumi [85]
5Maria Axenovich [11]
6Paul N. Balister (Paul Balister) [61]
7Thomas Böhme [18] [71]
8Béla Bollobás [34] [87]
9Oleg V. Borodin [1] [16] [22] [24] [26] [31] [37] [42] [47] [62] [89] [96] [98]
10Graham Brightwell [76]
11Hajo Broersma (H. J. Broersma) [18]
12Walter A. Deuber [17] [39]
13Nancy Eaton [79]
14Paul Erdös [17]
15Dmitry Fon-Der-Flaass [9] [11] [30] [42] [49]
16Zoltán Füredi [68] [79]
17Alexei N. Glebov [74]
18N. I. Glebov [27]
19F. Göbel [18]
20Ronald J. Gould [75]
21David S. Gunderson [17]
22Gregory Gutin [38]
23Ervin Györi [20]
24Peter Hamburger [29] [80] [85]
25Penny E. Haxell [80]
26Pavol Hell [44]
27Anna O. Ivanova [98]
28Hemanshu Kaul [81] [94]
29Ken-ichi Kawarabayashi [78]
30Hal A. Kierstead (Henry A. Kierstead) [76] [88] [93] [97]
31Seog-Jin Kim [62] [63]
32Jan Kratochvíl [19]
33Hao Li [61]
34Tomasz Luczak [20]
35A. G. Meyer [17]
36Dhruv Mubayi [41] [92]
37Kittikorn Nakprasit [57] [58] [63] [65] [66] [87]
38Jaroslav Nesetril (Jarik Nesetril) [23] [26] [31] [32] [45] [49] [50]
39Sriram V. Pemmaraju [58] [66]
40Irina G. Perepelitsa [36]
41Noah Prince [90]
42László Pyber [5]
43André Raspaud [26] [31] [42] [44] [47] [49]
44Vojtech Rödl [21] [28] [41] [64] [77]
45Alexander A. Sapozhenko [8]
46Richard H. Schelp [34] [61]
47Naeem N. Sheikh [89] [96] [98]
48Jozef Skokan [79]
49Riste Skrekovski [68]
50P. Smolíková [45]
51Eric Sopena [26] [31] [42] [44] [47] [49]
52Michael Stiebitz [14] [18] [25] [40] [55] [68]
53B. Y. Stodolsky [73]
54Benny Sudakov [56]
55Zoltán Szigeti [12]
56Vladimir A. Tashkinov [54] [74]
57Prasad Tetali [41]
58Bjarne Toft [37] [38]
59Jacques Verstraëte [69]
60K. Weber [8]
61Douglas B. West [59] [62] [68]
62Peter Winkler (Peter M. Winkler) [76]
63B. Wirth [14]
64Douglas R. Woodall [16] [22] [24] [30] [35] [43] [46] [48] [70]
65Gexin Yu [67] [72] [75] [78] [82] [84] [86] [89] [91] [94] [96]
66Xuding Zhu [83]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)