Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarAlexandr V. Kostochka
Person information
- affiliation: University of Illinois at Urbana-Champaign, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2019
[j206]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
:
A variation of a theorem by Pósa. Discrete Mathematics 342(7): 1919-1923 (2019)- [j205]Anton Bernshteyn, Alexandr V. Kostochka:
DP-colorings of hypergraphs. Eur. J. Comb. 78: 134-146 (2019) - [j204]József Balogh, Alexandr V. Kostochka, Xujun Liu:
Packing Chromatic Number of Subdivisions of Cubic Graphs. Graphs and Combinatorics 35(2): 513-537 (2019) - [j203]Ilkyoo Choi, Ringi Kim, Alexandr V. Kostochka, Boram Park, Douglas B. West:
Largest 2-Regular Subgraphs in 3-Regular Graphs. Graphs and Combinatorics 35(4): 805-813 (2019) - [j202]Guantao Chen, Hein van der Holst, Alexandr V. Kostochka, Nana Li:
Extremal Union-Closed Set Families. Graphs and Combinatorics 35(6): 1495-1502 (2019) - [j201]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo:
Avoiding long Berge cycles. J. Comb. Theory, Ser. B 137: 55-64 (2019) - [j200]Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Hypergraphs Not Containing a Tight Tree with a Bounded Trunk. SIAM J. Discrete Math. 33(2): 862-873 (2019) - [c5]Alexandr V. Kostochka, Xujun Liu, Roberto Machado, Olgica Milenkovic:
Directed Intersection Representations and the Information Content of Digraphs. ISIT 2019: 1477-1481 - 2018
- [j199]Alexandr V. Kostochka, Matthew P. Yancey:
A Brooks-Type Result for Sparse Critical Graphs. Combinatorica 38(4): 887-934 (2018) - [j198]Hal A. Kierstead, Alexandr V. Kostochka, Andrew McConvey:
A Sharp Dirac-Erdős Type Bound for Large Graphs. Combinatorics, Probability & Computing 27(3): 387-397 (2018) - [j197]József Balogh, Alexandr V. Kostochka, Xujun Liu:
Packing chromatic number of cubic graphs. Discrete Mathematics 341(2): 474-483 (2018) - [j196]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo, Jacques Verstraëte:
Stability in the Erdős-Gallai Theorem on cycles and paths, II. Discrete Mathematics 341(5): 1253-1263 (2018) - [j195]Samia Kerdjoudj, Alexandr V. Kostochka, André Raspaud:
List star edge-coloring of subcubic graphs. Discussiones Mathematicae Graph Theory 38(4): 1037-1054 (2018) - [j194]Ilkyoo Choi, Jaehoon Kim, Alexandr V. Kostochka, André Raspaud:
Strong edge-colorings of sparse graphs with large maximum degree. Eur. J. Comb. 67: 21-39 (2018) - [j193]Anton Bernshteyn, Alexandr V. Kostochka:
Sharp Dirac's theorem for DP-critical graphs. Journal of Graph Theory 88(3): 521-546 (2018) - [j192]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo:
Extensions of a theorem of Erdős on nonhamiltonian graphs. Journal of Graph Theory 89(2): 176-193 (2018) - 2017
- [j191]Henry A. Kierstead, Alexandr V. Kostochka, Elyse Yeager:
The (2k-1)-connected multigraphs with at most k-1 disjoint cycles. Combinatorica 37(1): 77-86 (2017) - [j190]Alexandr V. Kostochka, Benny Sudakov, Jacques Verstraëte:
Cycles in triangle-free graphs of large chromatic number. Combinatorica 37(3): 481-494 (2017) - [j189]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo:
A stability version for a theorem of Erdős on nonhamiltonian graphs. Discrete Mathematics 340(11): 2688-2690 (2017) - [j188]Anton Bernshteyn, Alexandr V. Kostochka, Xuding Zhu:
DP-colorings of graphs with high chromatic number. Eur. J. Comb. 65: 122-129 (2017) - [j187]Henry A. Kierstead, Alexandr V. Kostochka, Elyse Yeager:
On the Corrádi-Hajnal theorem and a question of Dirac. J. Comb. Theory, Ser. B 122: 121-148 (2017) - [j186]Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Turán problems and shadows II: Trees. J. Comb. Theory, Ser. B 122: 457-478 (2017) - [j185]Min Chen, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West, Xuding Zhu:
Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2. J. Comb. Theory, Ser. B 122: 741-756 (2017) - [j184]Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka:
Tight Descriptions of 3-Paths in Normal Plane Maps : Dedicated to Andre Raspaud on the occasion of his 70th birthday. Journal of Graph Theory 85(1): 115-132 (2017) - [j183]Hal A. Kierstead, Alexandr V. Kostochka, Andrew McConvey:
Strengthening Theorems of Dirac and Erdős on Disjoint Cycles. Journal of Graph Theory 85(4): 788-802 (2017) - 2016
- [j182]Alexandr V. Kostochka, Jaroslav Nesetril:
Adding Edges to Increase the Chromatic Number of a Graph. Combinatorics, Probability & Computing 25(4): 592-594 (2016) - [j181]Anton Bernshteyn, Alexandr V. Kostochka:
On the number of edges in a graph with no (k+1)-connected subgraphs. Discrete Mathematics 339(2): 682-688 (2016) - [j180]Ervin Györi, Alexandr V. Kostochka, Andrew McConvey, Derrek Yager:
A list version of graph packing. Discrete Mathematics 339(8): 2178-2185 (2016) - [j179]Alexandr V. Kostochka, Andrew McConvey, Derrek Yager:
On a packing problem of Alon and Yuster. Discrete Mathematics 339(11): 2785-2792 (2016) - [j178]Alexandr V. Kostochka, Xiaodong Li, Watcharintorn Ruksasakchai, Michael Santana, Tao Wang, G. Yu:
Strong chromatic index of subcubic planar multigraphs. Eur. J. Comb. 51: 380-397 (2016) - [j177]Zoltán Füredi, Alexandr V. Kostochka, Jacques Verstraëte:
Stability in the Erdős-Gallai Theorems on cycles and paths. J. Comb. Theory, Ser. B 121: 197-228 (2016) - [j176]Jaehoon Kim, Alexandr V. Kostochka, Xuding Zhu:
Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions. Journal of Graph Theory 81(4): 403-413 (2016) - 2015
- [j175]Hal A. Kierstead, Alexandr V. Kostochka:
A refinement of a result of Corrádi and Hajnal. Combinatorica 35(4): 497-512 (2015) - [j174]Alexandr V. Kostochka, B. M. Reiniger:
The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges. Eur. J. Comb. 46: 89-94 (2015) - [j173]Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Turán problems and shadows I: Paths and cycles. J. Comb. Theory, Ser. A 129: 57-79 (2015) - [j172]Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Turán Problems and Shadows III: Expansions of Graphs. SIAM J. Discrete Math. 29(2): 868-876 (2015) - 2014
- [j171]Alexandr V. Kostochka, Matthew P. Yancey:
Ore's conjecture for k=4 and Grötzsch's Theorem. Combinatorica 34(3): 323-329 (2014) - [j170]Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka:
Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11. Discrete Mathematics 315-316: 128-134 (2014) - [j169]Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka:
Describing faces in plane triangulations. Discrete Mathematics 319: 47-61 (2014) - [j168]Alexandr V. Kostochka:
A new tool for proving Vizing's Theorem. Discrete Mathematics 326: 1-3 (2014) - [j167]Jaehoon Kim, Alexandr V. Kostochka:
Maximum hypergraphs without regular subgraphs. Discussiones Mathematicae Graph Theory 34(1): 151-166 (2014) - [j166]Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey:
Short proofs of coloring theorems on planar graphs. Eur. J. Comb. 36: 314-321 (2014) - [j165]Oleg V. Borodin, Zdenek Dvorák, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey:
Planar 4-critical graphs with four triangles. Eur. J. Comb. 41: 138-151 (2014) - [j164]Jaehoon Kim, Alexandr V. Kostochka, Xuding Zhu:
Improper coloring of sparse graphs with a given girth, I: (0, 1)-colorings of triangle-free graphs. Eur. J. Comb. 42: 26-48 (2014) - [j163]Oleg V. Borodin, Alexandr V. Kostochka:
Defective 2-colorings of sparse graphs. J. Comb. Theory, Ser. B 104: 72-80 (2014) - [j162]Alexandr V. Kostochka, Matthew P. Yancey:
Ore's conjecture on color-critical graphs is almost true. J. Comb. Theory, Ser. B 109: 73-101 (2014) - [j161]Alexandr V. Kostochka:
Ks, t Minors in (s+t)- Chromatic Graphs, II. Journal of Graph Theory 75(4): 377-386 (2014) - [j160]Zoltán Füredi, Alexandr V. Kostochka, Mohit Kumbhat:
Choosability with Separation of Complete Multipartite Graphs and Hypergraphs. Journal of Graph Theory 76(2): 129-137 (2014) - [j159]Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
On independent sets in hypergraphs. Random Struct. Algorithms 44(2): 224-239 (2014) - 2013
- [j158]József Balogh, Alexandr V. Kostochka, Andrew Treglown:
On Perfect Packings in Dense Graphs. Electr. J. Comb. 20(1): P57 (2013) - [j157]Alexandr V. Kostochka:
On almost (k-1)-degenerate (k+1)-chromatic graphs and hypergraphs. Discrete Mathematics 313(4): 366-374 (2013) - [j156]Oleg V. Borodin, Alexandr V. Kostochka, Matthew P. Yancey:
On 11-improper 22-coloring of sparse graphs. Discrete Mathematics 313(22): 2638-2649 (2013) - [j155]Oleg V. Borodin, Anna O. Ivanova, Tommy R. Jensen, Alexandr V. Kostochka, Matthew P. Yancey:
Describing 3-paths in normal plane maps. Discrete Mathematics 313(23): 2702-2711 (2013) - [j154]József Balogh, Alexandr V. Kostochka, Andrei M. Raigorodskii:
Coloring some finite sets in Rn . Discussiones Mathematicae Graph Theory 33(1): 25-31 (2013) - [j153]Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Hypergraph Ramsey numbers: Triangles versus cliques. J. Comb. Theory, Ser. A 120(7): 1491-1507 (2013) - [j152]Alexandr V. Kostochka, Christopher J. Stocker, Peter Hamburger:
A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge. Journal of Graph Theory 74(2): 222-235 (2013) - [j151]Hal A. Kierstead, Alexandr V. Kostochka:
Equitable List Coloring of Graphs with Bounded Degree. Journal of Graph Theory 74(3): 309-334 (2013) - [j150]Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West, Hehui Wu, Xuding Zhu:
Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree. Journal of Graph Theory 74(4): 369-391 (2013) - [c4]Alexandr V. Kostochka, Matthew P. Yancey:
On Coloring of Sparse Graphs. CSR 2013: 224-234 - [p1]Alexandr V. Kostochka:
A Bound of the Cardinality of Families Not Containing \(\Delta \) -Systems. The Mathematics of Paul Erdős II 2013: 199-206 - [i3]Oleg V. Borodin, Zdenek Dvorák, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey:
Planar 4-critical graphs with four triangles. CoRR abs/1306.1477 (2013) - 2012
- [j149]Alexandr V. Kostochka, Matthew P. Yancey:
Large Rainbow Matchings in Edge-Coloured Graphs. Combinatorics, Probability & Computing 21(1-2): 255-263 (2012) - [j148]Alexandr V. Kostochka, Mohit Kumbhat, Tomasz Luczak:
Conflict-Free Colourings of Uniform Hypergraphs With Few Edges. Combinatorics, Probability & Computing 21(4): 611-622 (2012) - [j147]Alexandr V. Kostochka, Landon Rabern, Michael Stiebitz:
Graphs with chromatic number close to maximum degree. Discrete Mathematics 312(6): 1273-1281 (2012) - [j146]Saieed Akbari, Jaehoon Kim, Alexandr V. Kostochka:
Harmonious coloring of trees with large maximum degree. Discrete Mathematics 312(10): 1633-1637 (2012) - [j145]Noga Alon, Alexandr V. Kostochka:
Dense uniform hypergraphs have high list chromatic number. Discrete Mathematics 312(14): 2119-2125 (2012) - [j144]Alexandr V. Kostochka, Noah Prince:
On Ks, t-minors in graphs with given average degree, II. Discrete Mathematics 312(24): 3517-3522 (2012) - [j143]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) - [j142]Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé:
Packing and Covering Triangles in K 4-free Planar Graphs. Graphs and Combinatorics 28(5): 653-662 (2012) - [j141]Alexandr V. Kostochka, Gexin Yu:
Graphs Containing Every 2-Factor. Graphs and Combinatorics 28(5): 687-716 (2012) - [j140]Henry A. Kierstead, Alexandr V. Kostochka:
Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring. Journal of Graph Theory 71(1): 31-48 (2012) - [i2]Saieed Akbari, Jaehoon Kim, Alexandr V. Kostochka:
Harmonious Coloring of Trees with Large Maximum Degree. CoRR abs/1202.1046 (2012) - [i1]Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey:
Short proofs of coloring theorems on planar graphs. CoRR abs/1211.3981 (2012) - 2011
- [j139]Alexandr V. Kostochka, Christopher J. Stocker:
Graphs with maximum degree 5 are acyclically 7-colorable. Ars Math. Contemp. 4(1): 153-164 (2011) - [j138]Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason:
Minors in Graphs with High Chromatic Number. Combinatorics, Probability & Computing 20(4): 513-518 (2011) - [j137]Alexandr V. Kostochka, Michael Stiebitz, Douglas R. Woodall:
Ohba's conjecture for graphs with independence number five. Discrete Mathematics 311(12): 996-1005 (2011) - [j136]József Balogh, Alexandr V. Kostochka:
Large minors in graphs with given independence number. Discrete Mathematics 311(20): 2203-2215 (2011) - [j135]Noga Alon, Alexandr V. Kostochka:
Hypergraph list coloring and Euclidean Ramsey theory. Random Struct. Algorithms 39(3): 377-390 (2011) - 2010
- [j134]Henry A. Kierstead, Alexandr V. Kostochka:
Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture. Combinatorica 30(2): 201-216 (2010) - [j133]Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi:
A fast algorithm for equitable coloring. Combinatorica 30(2): 217-224 (2010) - [j132]Alexandr V. Kostochka, Noah Prince:
Dense graphs have K3, t minors. Discrete Mathematics 310(20): 2637-2654 (2010) - [j131]Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason:
Hadwiger numbers and over-dominating colourings. Discrete Mathematics 310(20): 2662-2665 (2010) - [j130]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) - [j129]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) - [j128]Alexandr V. Kostochka:
On Ks, t minors in (s+t)-chromatic graphs. Journal of Graph Theory 65(4): 343-350 (2010) - [j127]Alexandr V. Kostochka, Vojtech Rödl:
Constructions of sparse uniform hypergraphs with high chromatic number. Random Struct. Algorithms 36(1): 46-56 (2010)
2000 – 2009
- 2009
- [j126]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) - [j125]Hal A. Kierstead, Alexandr V. Kostochka:
Efficient Graph Packing via Game Colouring. Combinatorics, Probability & Computing 18(5): 765-774 (2009) - [j124]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) - [j123]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) - [j122]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) - [j121]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) - [j120]Alexandr V. Kostochka, Gexin Yu:
Ore-type conditions implying 2-factors consisting of short cycles. Discrete Mathematics 309(14): 4762-4771 (2009) - [j119]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) - [j118]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) - [j117]Hal A. Kierstead, Alexandr V. Kostochka:
Ore-type versions of Brooks' theorem. J. Comb. Theory, Ser. B 99(2): 298-305 (2009) - [j116]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) - [j115]Noga Alon, Alexandr V. Kostochka:
Induced subgraphs with distinct sizes. Random Struct. Algorithms 34(1): 45-53 (2009) - [j114]Alexandr V. Kostochka, Mohit Kumbhat:
Coloring uniform hypergraphs with few edges. Random Struct. Algorithms 35(3): 348-368 (2009) - 2008
- [j113]Hemanshu Kaul, Alexandr V. Kostochka, Gexin Yu:
On a graph packing conjecture by Bollobás, Eldridge and Catlin. Combinatorica 28(4): 469-485 (2008) - [j112]Alexandr V. Kostochka, Michael Stiebitz:
Partitions and Edge Colourings of Multigraphs. Electr. J. Comb. 15(1) (2008) - [j111]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) - [j110]Alexandr V. Kostochka, Dhruv Mubayi:
When is an Almost Monochromatic K4 Guaranteed? Combinatorics, Probability & Computing 17(6): 823-830 (2008) - [j109]Alexandr V. Kostochka, Gexin Yu:
Minimum degree conditions for H-linked graphs. Discrete Applied Mathematics 156(9): 1542-1548 (2008) - [j108]Alexandr V. Kostochka, Noah Prince:
On Ks, t-minors in graphs with given average degree. Discrete Mathematics 308(19): 4435-4445 (2008) - [j107]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) - [j106]József Balogh, Alexandr V. Kostochka:
On 2-Detour Subgraphs of the Hypercube. Graphs and Combinatorics 24(4): 265-272 (2008) - [j105]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) - [j104]Béla Bollobás, Alexandr V. Kostochka, Kittikorn Nakprasit:
Packing d-degenerate graphs. J. Comb. Theory, Ser. B 98(1): 85-94 (2008) - [j103]Hal A. Kierstead, Alexandr V. Kostochka:
An Ore-type theorem on equitable coloring. J. Comb. Theory, Ser. B 98(1): 226-234 (2008) - [j102]Alexandr V. Kostochka, Gexin Yu:
Packing of graphs with small product of sizes. J. Comb. Theory, Ser. B 98(6): 1411-1415 (2008) - [j101]Nana Arizumi, Peter Hamburger, Alexandr V. Kostochka:
On k-detour subgraphs of hypercubes. Journal of Graph Theory 57(1): 55-64 (2008) - [j100]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) - [j99]Alexandr V. Kostochka, Xuding Zhu:
Adapted List Coloring of Graphs and Hypergraphs. SIAM J. Discrete Math. 22(1): 398-408 (2008) - 2007
- [j98]Peter Hamburger, Penny E. Haxell, Alexandr V. Kostochka:
On Directed Triangles in Digraphs. Electr. J. Comb. 14(1) (2007) - [j97]Alexandr V. Kostochka, Gexin Yu:
Ore-type graph packing problems. Combinatorics, Probability & Computing 16(1): 167-169 (2007) - [j96]Hemanshu Kaul, Alexandr V. Kostochka:
Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer. Combinatorics, Probability & Computing 16(3): 409-416 (2007) - [j95]Nancy Eaton, Zoltán Füredi, Alexandr V. Kostochka, Jozef Skokan:
Tree representations of graphs. Eur. J. Comb. 28(4): 1087-1098 (2007) - [j94]Alexandr V. Kostochka, Gexin Yu:
An Ore-type analogue of the Sauer-Spencer Theorem. Graphs and Combinatorics 23(4): 419-424 (2007) - 2006
- [j93]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) - [j92]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) - [j91]Noga Alon, Graham R. 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) - [j90]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) - [j89]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
- [j88]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) - [j87]Alexandr V. Kostochka, B. Y. Stodolsky:
On domination in connected cubic graphs. Discrete Mathematics 304(1-3): 45-50 (2005) - [j86]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) - [j85]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) - [j84]Alexandr V. Kostochka, Gexin Yu:
Minimum degree conditions for H-linked graphs. Electronic Notes in Discrete Mathematics 21: 331 (2005) - [j83]Alexandr V. Kostochka, Jacques Verstraëte:
Even cycles in hypergraphs. J. Comb. Theory, Ser. B 94(1): 173-182 (2005) - [j82]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) - [j81]