![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Alexandr V. Kostochka
Person information
- affiliation: University of Illinois at Urbana-Champaign, USA
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j242]Alexandr V. Kostochka, Ruth Luo, Grace McCourt:
A Hypergraph Analog of Dirac's Theorem for Long Cycles in 2-Connected Graphs. Comb. 44(4): 849-880 (2024) - [j241]Alexandr V. Kostochka, Jingwei Xu
:
Sparse critical graphs for defective DP-colorings. Discret. Math. 347(5): 113899 (2024) - [j240]Alexandr V. Kostochka, Duo Lin, Zimu Xiang
:
Equitable coloring of planar graphs with maximum degree at least eight. Discret. Math. 347(6): 113964 (2024) - [j239]Alexandr V. Kostochka, Ruth Luo, Grace McCourt
:
On a property of 2-connected graphs and Dirac's Theorem. Discret. Math. 347(11): 114153 (2024) - [j238]Alexandr V. Kostochka, Ruth Luo, Grace McCourt:
Dirac-type theorems for long Berge cycles in hypergraphs. J. Comb. Theory B 168: 159-191 (2024) - 2023
- [j237]Jaehoon Kim, Alexandr V. Kostochka, Suil O
, Yongtang Shi, Zhiwen Wang:
A sharp lower bound for the spectral radius in K4-saturated graphs. Discret. Math. 346(2): 113231 (2023) - [j236]Alexandr V. Kostochka, Thomas Schweser, Michael Stiebitz:
Generalized DP-colorings of graphs. Discret. Math. 346(11): 113186 (2023) - [j235]Sean English
, Alexandr V. Kostochka
, Dara Zirlin:
Saturation for the 3-uniform loose 3-cycle. Discret. Math. 346(11): 113504 (2023) - [j234]Alexandr V. Kostochka, Ruth Luo, Grace McCourt:
Minimum degree ensuring that a hypergraph is hamiltonian-connected. Eur. J. Comb. 114: 103782 (2023) - [j233]Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Extremal Problems for Hypergraph Blowups of Trees. SIAM J. Discret. Math. 37(4): 2397-2416 (2023) - 2022
- [j232]Alexandr V. Kostochka, Ruth Luo, Songling Shan:
Towards the Small Quasi-Kernel Conjecture. Electron. J. Comb. 29(3) (2022) - [j231]József Balogh, Alexandr V. Kostochka, Mikhail Lavrov, Xujun Liu:
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree. Comb. Probab. Comput. 31(1): 109-122 (2022) - [j230]Yifan Jing
, Alexandr V. Kostochka, Fuhong Ma, Jingwei Xu
:
Defective DP-colorings of sparse simple graphs. Discret. Math. 345(1): 112637 (2022) - [j229]Alexandr V. Kostochka, Mikhail Lavrov, Ruth Luo, Dara Zirlin:
Longest cycles in 3-connected hypergraphs and bipartite graphs. J. Graph Theory 99(4): 758-782 (2022) - [j228]József Balogh, Alexandr V. Kostochka, Mikhail Lavrov, Xujun Liu:
Monochromatic connected matchings in 2-edge-colored multipartite graphs. J. Graph Theory 100(3): 578-607 (2022) - 2021
- [j227]Alexandr V. Kostochka, Mikhail Lavrov, Ruth Luo, Dara Zirlin:
Conditions for a Bigraph to be Super-Cyclic. Electron. J. Comb. 28(1): 1 (2021) - [j226]Alexandr V. Kostochka, Xujun Liu
:
Packing (1, 1, 2, 4)-coloring of subcubic outerplanar graphs. Discret. Appl. Math. 302: 8-15 (2021) - [j225]Alexandr V. Kostochka, Mina Nahvi, Douglas B. West, Dara Zirlin:
3-regular graphs are 2-reconstructible. Eur. J. Comb. 91: 103216 (2021) - [j224]Alexandr V. Kostochka, Jingwei Xu:
On 2-defective DP-colorings of sparse graphs. Eur. J. Comb. 91: 103217 (2021) - [j223]Yifan Jing
, Alexandr V. Kostochka, Fuhong Ma, Pongpat Sittitrai, Jingwei Xu:
Defective DP-colorings of sparse multigraphs. Eur. J. Comb. 93: 103267 (2021) - [j222]Alexandr V. Kostochka, André Raspaud, Jingwei Xu:
Injective edge-coloring of graphs with given maximum degree. Eur. J. Comb. 96: 103355 (2021) - [j221]Alexandr V. Kostochka, André Raspaud, Bjarne Toft, Douglas B. West, Dara Zirlin:
Cut-Edges and Regular Factors in Regular Graphs of Odd Degree. Graphs Comb. 37(1): 199-207 (2021) - [j220]Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Partitioning ordered hypergraphs. J. Comb. Theory A 177: 105300 (2021) - [j219]Alexandr V. Kostochka
, Douglas B. West
:
On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices. IEEE Trans. Inf. Theory 67(6): 3278-3286 (2021) - 2020
- [j218]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo:
Berge Cycles in Non-Uniform Hypergraphs. Electron. J. Comb. 27(3): 3 (2020) - [j217]Zoltán Füredi
, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2. Discret. Appl. Math. 276: 50-59 (2020) - [j216]Alexandr V. Kostochka, Ruth Luo:
On r-uniform hypergraphs with circumference less than r. Discret. Appl. Math. 276: 69-91 (2020) - [j215]Seog-Jin Kim, Alexandr V. Kostochka, Xuer Li, Xuding Zhu:
On-line DP-coloring of graphs. Discret. Appl. Math. 285: 443-453 (2020) - [j214]Zoltán Füredi, Alexandr V. Kostochka
, Dhruv Mubayi, Jacques Verstraëte:
Ordered and Convex Geometric Trees with Linear Extremal Function. Discret. Comput. Geom. 64(2): 324-338 (2020) - [j213]Jaehoon Kim, Seog-Jin Kim, Alexandr V. Kostochka, Suil O
:
The minimum spectral radius of Kr+1-saturated graphs. Discret. Math. 343(11): 112068 (2020) - [j212]Alexandr V. Kostochka, Mina Nahvi, Douglas B. West, Dara Zirlin:
Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices. Graphs Comb. 36(3): 491-501 (2020) - [j211]Alexandr V. Kostochka, Michael Stiebitz
:
The Minimum Number of Edges in 4-Critical Digraphs of Given Order. Graphs Comb. 36(3): 703-718 (2020) - [j210]Alexandr V. Kostochka, Ruth Luo, Dara Zirlin:
Super-pancyclic hypergraphs and bipartite graphs. J. Comb. Theory B 145: 450-465 (2020) - [j209]Anton Bernshteyn
, Alexandr V. Kostochka, Xuding Zhu:
Fractional DP-colorings of sparse graphs. J. Graph Theory 93(2): 203-221 (2020) - 2019
- [j208]József Balogh, Alexandr V. Kostochka, Xujun Liu:
Cubic Graphs with Small Independence Ratio. Electron. J. Comb. 26(1): 1 (2019) - [j207]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo:
On 2-Connected Hypergraphs with No Long Cycles. Electron. J. Comb. 26(4): 4 (2019) - [j206]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
:
A variation of a theorem by Pósa. Discret. Math. 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 Comb. 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 Comb. 35(4): 805-813 (2019) - [j202]Guantao Chen, Hein van der Holst, Alexandr V. Kostochka, Nana Li:
Extremal Union-Closed Set Families. Graphs Comb. 35(6): 1495-1502 (2019) - [j201]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
:
Avoiding long Berge cycles. J. Comb. Theory 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. Discret. Math. 33(2): 862-873 (2019) - 2018
- [j199]Alexandr V. Kostochka, Matthew P. Yancey:
A Brooks-Type Result for Sparse Critical Graphs. Comb. 38(4): 887-934 (2018) - [j198]Hal A. Kierstead, Alexandr V. Kostochka, Andrew McConvey:
A Sharp Dirac-Erdős Type Bound for Large Graphs. Comb. Probab. Comput. 27(3): 387-397 (2018) - [j197]József Balogh, Alexandr V. Kostochka, Xujun Liu
:
Packing chromatic number of cubic graphs. Discret. Math. 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. Discret. Math. 341(5): 1253-1263 (2018) - [j195]Samia Kerdjoudj, Alexandr V. Kostochka, André Raspaud:
List star edge-coloring of subcubic graphs. Discuss. Math. 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. J. 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. J. 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. Comb. 37(1): 77-86 (2017) - [j190]Alexandr V. Kostochka, Benny Sudakov, Jacques Verstraëte:
Cycles in triangle-free graphs of large chromatic number. Comb. 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. Discret. Math. 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 B 122: 121-148 (2017) - [j186]Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Turán problems and shadows II: Trees. J. Comb. Theory 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 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. J. 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. J. Graph Theory 85(4): 788-802 (2017) - 2016
- [j182]Alexandr V. Kostochka, Jaroslav Nesetril
:
Adding Edges to Increase the Chromatic Number of a Graph. Comb. Probab. Comput. 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. Discret. Math. 339(2): 682-688 (2016) - [j180]Ervin Györi, Alexandr V. Kostochka, Andrew McConvey, Derrek Yager:
A list version of graph packing. Discret. Math. 339(8): 2178-2185 (2016) - [j179]Alexandr V. Kostochka, Andrew McConvey, Derrek Yager
:
On a packing problem of Alon and Yuster. Discret. Math. 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 B 121: 197-228 (2016) - [j176]Jaehoon Kim
, Alexandr V. Kostochka, Xuding Zhu:
Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions. J. 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. Comb. 35(4): 497-512 (2015) - [j174]Alexandr V. Kostochka, Benjamin 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 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. Discret. 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. Comb. 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. Discret. Math. 315-316: 128-134 (2014) - [j169]Oleg V. Borodin, Anna O. Ivanova
, Alexandr V. Kostochka:
Describing faces in plane triangulations. Discret. Math. 319: 47-61 (2014) - [j168]Alexandr V. Kostochka:
A new tool for proving Vizing's Theorem. Discret. Math. 326: 1-3 (2014) - [j167]Jaehoon Kim
, Alexandr V. Kostochka:
Maximum hypergraphs without regular subgraphs. Discuss. Math. 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 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 B 109: 73-101 (2014) - [j161]Alexandr V. Kostochka:
Ks, t Minors in (s+t)- Chromatic Graphs, II. J. 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. J. 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. Electron. J. Comb. 20(1): 57 (2013) - [j157]Alexandr V. Kostochka:
On almost (k-1)-degenerate (k+1)-chromatic graphs and hypergraphs. Discret. Math. 313(4): 366-374 (2013) - [j156]Oleg V. Borodin, Alexandr V. Kostochka, Matthew P. Yancey:
On 11-improper 22-coloring of sparse graphs. Discret. Math. 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. Discret. Math. 313(23): 2702-2711 (2013) - [j154]József Balogh, Alexandr V. Kostochka, Andrei M. Raigorodskii:
Coloring some finite sets in Rn . Discuss. Math. 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 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. J. Graph Theory 74(2): 222-235 (2013) - [j151]Hal A. Kierstead, Alexandr V. Kostochka:
Equitable List Coloring of Graphs with Bounded Degree. J. 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. J. Graph Theory 74(4): 369-391 (2013) - 2012
- [j149]Alexandr V. Kostochka, Matthew P. Yancey:
Large Rainbow Matchings in Edge-Coloured Graphs. Comb. Probab. Comput. 21(1-2): 255-263 (2012) - [j148]Alexandr V. Kostochka, Mohit Kumbhat, Tomasz Luczak
:
Conflict-Free Colourings of Uniform Hypergraphs With Few Edges. Comb. Probab. Comput. 21(4): 611-622 (2012) - [j147]Alexandr V. Kostochka, Landon Rabern, Michael Stiebitz:
Graphs with chromatic number close to maximum degree. Discret. Math. 312(6): 1273-1281 (2012) - [j146]Saieed Akbari
, Jaehoon Kim
, Alexandr V. Kostochka:
Harmonious coloring of trees with large maximum degree. Discret. Math. 312(10): 1633-1637 (2012) - [j145]Noga Alon, Alexandr V. Kostochka:
Dense uniform hypergraphs have high list chromatic number. Discret. Math. 312(14): 2119-2125 (2012) - [j144]Alexandr V. Kostochka, Noah Prince:
On Ks, t-minors in graphs with given average degree, II. Discret. Math. 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 Comb. 28(5): 653-662 (2012) - [j141]Alexandr V. Kostochka, Gexin Yu:
Graphs Containing Every 2-Factor. Graphs Comb. 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. J. Graph Theory 71(1): 31-48 (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. Comb. Probab. Comput. 20(4): 513-518 (2011) - [j137]Alexandr V. Kostochka, Michael Stiebitz, Douglas R. Woodall:
Ohba's conjecture for graphs with independence number five. Discret. Math. 311(12): 996-1005 (2011) - [j136]József Balogh, Alexandr V. Kostochka:
Large minors in graphs with given independence number. Discret. Math. 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. Comb. 30(2): 201-216 (2010) - [j133]Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi:
A fast algorithm for equitable coloring. Comb. 30(2): 217-224 (2010) - [j132]Alexandr V. Kostochka, Noah Prince:
Dense graphs have K3, t minors. Discret. Math. 310(20): 2637-2654 (2010) - [j131]Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason:
Hadwiger numbers and over-dominating colourings. Discret. Math. 310(20): 2662-2665 (2010) - [j130]Alexandr V. Kostochka, Pavel Pudlák, Vojtech Rödl:
Some constructive bounds on Ramsey numbers. J. Comb. Theory 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 B 100(6): 554-559 (2010) - [j128]Alexandr V. Kostochka:
On Ks, t minors in (s+t)-chromatic graphs. J. 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) - 2009
- [j126]Noga Alon, József Balogh, Alexandr V. Kostochka, Wojciech Samotij:
Sizes of Induced Subgraphs of Ramsey Graphs. Comb. Probab. Comput. 18(4): 459-476 (2009) - [j125]Hal A. Kierstead, Alexandr V. Kostochka:
Efficient Graph Packing via Game Colouring. Comb. Probab. Comput. 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. Discret. Math. 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. Discret. Math. 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. Discret. Math. 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. Discret. Math. 309(12): 3985-3991 (2009) - [j120]Alexandr V. Kostochka, Gexin Yu:
Ore-type conditions implying 2-factors consisting of short cycles. Discret. Math. 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. Discret. Math. 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. Discuss. Math. Graph Theory 29(1): 87-99 (2009) - [j117]Hal A. Kierstead, Alexandr V. Kostochka:
Ore-type versions of Brooks' theorem. J. Comb. Theory 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. J. 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. Comb. 28(4): 469-485 (2008) - [j112]Alexandr V. Kostochka, Michael Stiebitz:
Partitions and Edge Colourings of Multigraphs. Electron. J. Comb. 15(1) (2008) - [j111]Hal A. Kierstead, Alexandr V. Kostochka:
A Short Proof of the Hajnal-Szemerédi Theorem on Equitable Colouring. Comb. Probab. Comput. 17(2): 265-270 (2008) - [j110]Alexandr V. Kostochka, Dhruv Mubayi:
When is an Almost Monochromatic K4 Guaranteed? Comb. Probab. Comput. 17(6): 823-830 (2008) - [j109]Alexandr V. Kostochka, Gexin Yu:
Minimum degree conditions for H-linked graphs. Discret. Appl. Math. 156(9): 1542-1548 (2008) - [j108]Alexandr V. Kostochka, Noah Prince:
On Ks, t-minors in graphs with given average degree. Discret. Math. 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 Comb. 24(4): 265-272 (2008) - [j105]L. Sunil Chandran, Alexandr V. Kostochka, J. Krishnam Raju:
Hadwiger Number and the Cartesian Product of Graphs. Graphs Comb. 24(4): 291-301 (2008) - [j104]Béla Bollobás, Alexandr V. Kostochka, Kittikorn Nakprasit:
Packing d-degenerate graphs. J. Comb. Theory B 98(1): 85-94 (2008) - [j103]Hal A. Kierstead, Alexandr V. Kostochka:
An Ore-type theorem on equitable coloring. J. Comb. Theory B 98(1): 226-234 (2008) - [j102]Alexandr V. Kostochka, Gexin Yu:
Packing of graphs with small product of sizes. J. Comb. Theory B 98(6): 1411-1415 (2008) - [j101]Nana Arizumi, Peter Hamburger, Alexandr V. Kostochka:
On k-detour subgraphs of hypercubes. J. Graph Theory 57(1): 55-64 (2008) - [j100]Alexandr V. Kostochka, Gexin Yu:
Ore-type degree conditions for a graph to be H-linked. J. Graph Theory 58(1): 14-26 (2008) - [j99]Alexandr V. Kostochka, Xuding Zhu:
Adapted List Coloring of Graphs and Hypergraphs. SIAM J. Discret. Math. 22(1): 398-408 (2008) - 2007
- [j98]Peter Hamburger, Penny E. Haxell, Alexandr V. Kostochka:
On Directed Triangles in Digraphs. Electron. J. Comb. 14(1) (2007) - [j97]Alexandr V. Kostochka, Gexin Yu:
Ore-type graph packing problems. Comb. Probab. Comput. 16(1): 167-169 (2007) - [j96]Hemanshu Kaul, Alexandr V. Kostochka:
Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer. Comb. Probab. Comput. 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 Comb. 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. Comb. Probab. Comput. 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. Discuss. Math. 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 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 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. Discret. 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. Discret. Math. 290(2/3): 269-274 (2005) - [j87]Alexandr V. Kostochka, B. Y. Stodolsky:
On domination in connected cubic graphs. Discret. Math. 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. Electron. Notes Discret. Math. 21: 331 (2005) - [j83]Alexandr V. Kostochka, Jacques Verstraëte:
Even cycles in hypergraphs. J. Comb. Theory 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. J. Graph Theory 50(4): 273-292 (2005) - [j81]Alexandr V. Kostochka, Gexin Yu:
An extremal problem for H-linked graphs. J. Graph Theory 50(4): 321-339 (2005) - [j80]Alexandr V. Kostochka, Kittikorn Nakprasit, Sriram V. Pemmaraju:
On Equitable Coloring of d-Degenerate Graphs. SIAM J. Discret. Math. 19(1): 83-95 (2005) - [j79]Alexandr V. Kostochka, Kittikorn Nakprasit:
On equitable Delta-coloring of graphs with low average degree. Theor. Comput. Sci. 349(1): 82-91 (2005) - 2004
- [j78]Alexandr V. Kostochka, Vojtech Rödl:
On Graphs With Small Ramsey Numbers, II. Comb. 24(3): 389-401 (2004) - [j77]Seog-Jin Kim, Alexandr V. Kostochka, Kittikorn Nakprasit:
On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane. Electron. J. Comb. 11(1) (2004) - [j76]Paul N. Balister, Alexandr V. Kostochka, Hao Li, Richard H. Schelp:
Balanced edge colorings. J. Comb. Theory B 90(1): 3-20 (2004) - [j75]Oleg V. Borodin, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West:
Homomorphisms from sparse graphs with large girth. J. Comb. Theory B 90(1): 147-159 (2004) - [j74]Alexandr V. Kostochka:
Coloring uniform hypergraphs with few colors. Random Struct. Algorithms 24(1): 1-10 (2004) - [j73]Michael O. Albertson, Alexandr V. Kostochka, Douglas B. West:
Precoloring Extensions of Brooks' Theorem. SIAM J. Discret. Math. 18(3): 542-553 (2004) - 2003
- [j72]Alexandr V. Kostochka, Kittikorn Nakprasit:
Equitable Colourings Of D-Degenerate Graphs. Comb. Probab. Comput. 12(1): 53-60 (2003) - [j71]Alexandr V. Kostochka, Benny Sudakov:
On Ramsey Numbers of Sparse Graphs. Comb. Probab. Comput. 12(5-6): 627-641 (2003) - [j70]Alexandr V. Kostochka, Michael Stiebitz:
A new lower bound on the number of edges in colour-critical graphs and hypergraphs. J. Comb. Theory B 87(2): 374-402 (2003) - [j69]Ralph J. Faudree, Ronald J. Gould, Alexandr V. Kostochka, Linda M. Lesniak, Ingo Schiermeyer, Akira Saito:
Degree conditions for k-ordered hamiltonian graphs. J. Graph Theory 42(3): 199-210 (2003) - [j68]Alexandr V. Kostochka, Michael J. Pelsmajer, Douglas B. West:
A list analogue of equitable coloring. J. Graph Theory 44(3): 166-177 (2003) - [j67]Alexandr V. Kostochka, Vladimir A. Tashkinov:
Decomposing Graphs into Long Paths. Order 20(3): 239-253 (2003) - 2002
- [j66]Alexandr V. Kostochka:
Transversals in Uniform Hypergraphs with Property (p, 2). Comb. 22(2): 275-285 (2002) - [j65]Alexandr V. Kostochka:
On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs. Electron. J. Comb. 9(1) (2002) - [j64]Alexandr V. Kostochka:
Equitable colorings of outerplanar graphs. Discret. Math. 258(1-3): 373-377 (2002) - [j63]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) - [j62]Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Jaroslav Nesetril
, André Raspaud, Éric Sopena:
Nilpotent Families of Endomorphisms of (p(V)+, cup). J. Comb. Theory B 86(1): 100-108 (2002) - [j61]Alexandr V. Kostochka, Michael Stiebitz:
A list version of Dirac's theorem on the number of edges in colour-critical graphs. J. Graph Theory 39(3): 165-177 (2002) - [j60]Alexandr V. Kostochka, Douglas R. Woodall:
Total choosability of multicircuits I. J. Graph Theory 40(1): 26-43 (2002) - [j59]Alexandr V. Kostochka, Douglas R. Woodall:
Total choosability of multicircuits II. J. Graph Theory 40(1): 44-67 (2002) - [j58]Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
Acyclic list 7-coloring of planar graphs. J. Graph Theory 40(2): 83-90 (2002) - 2001
- [j57]Alexandr V. Kostochka, Douglas R. Woodall:
Density Conditions for Panchromatic Colourings of Hypergraphs. Comb. 21(4): 515-541 (2001) - [j56]Oleg V. Borodin, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
Acyclic colouring of 1-planar graphs. Discret. Appl. Math. 114(1-3): 29-41 (2001) - [j55]Alexandr V. Kostochka, Douglas R. Woodall:
Sparse sets in the complements of graphs with given girth. Discret. Math. 233(1-3): 163-174 (2001) - [j54]Alexandr V. Kostochka, Jaroslav Nesetril
, Petra Smolíková
:
Colorings and homomorphisms of degenerate and bounded degree graphs. Discret. Math. 233(1-3): 257-276 (2001) - [j53]Pavol Hell, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
On nice graphs. Discret. Math. 234(1-3): 39-51 (2001) - [j52]Alexandr V. Kostochka, Douglas R. Woodall:
Choosability conjectures and multicircuits. Discret. Math. 240(1-3): 123-143 (2001) - [j51]Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
On Deeply Critical Oriented Graphs. J. Comb. Theory B 81(1): 150-155 (2001) - [j50]Alexandr V. Kostochka, Vojtech Rödl:
On graphs with small Ramsey numbers. J. Graph Theory 37(4): 198-204 (2001) - [j49]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
- [j48]Alexandr V. Kostochka, Michael Stiebitz:
On the Number of Edges in Colour-Critical Graphs and Hypergraphs. Comb. 20(4): 521-530 (2000) - [j47]Walter A. Deuber, Alexandr V. Kostochka:
On degrees of vertices in paradoxical trees. Discret. Math. 212(1-2): 53-59 (2000) - [j46]Gregory Z. Gutin, Alexandr V. Kostochka, Bjarne Toft:
On the Hajo's number of graphs. Discret. Math. 213(1-3): 153-161 (2000) - [j45]Oleg V. Borodin, Alexandr V. Kostochka, Bjarne Toft:
Variable degeneracy: extensions of Brooks' and Gallai's theorems. Discret. Math. 214(1-3): 101-112 (2000) - [j44]Alexandr V. Kostochka, Irina G. Perepelitsa:
Colouring triangle-free intersection graphs of boxes on the plane. Discret. Math. 220(1-3): 243-249 (2000) - [j43]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) - [j42]Béla Bollobás, Alexandr V. Kostochka, Richard H. Schelp:
Local and Mean Ramsey Numbers for Trees. J. Comb. Theory B 79(1): 100-103 (2000) - [j41]Alexander A. Ageev
, Alexandr V. Kostochka:
Vertex Set Partitions Preserving Conservativeness. J. Comb. Theory B 80(2): 202-217 (2000) - 1999
- [j40]Alexandr V. Kostochka, Jaroslav Nesetril:
Properties Of Descartes' Construction Of Triangle-Free Graphs With High Chromatic Number. Comb. Probab. Comput. 8(5): 467-472 (1999) - [j39]Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril
, André Raspaud, Éric Sopena:
On the maximum average degree and the oriented chromatic number of a graph. Discret. Math. 206(1-3): 77-89 (1999) - [j38]Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Douglas R. Woodall:
Transversals in uniform hypergraphs with property (7, 2). Discret. Math. 207(1-3): 277-284 (1999) - [j37]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) - [j36]Peter Hamburger, Alexandr V. Kostochka, Alexander F. Sidorenko:
Hypercube subgraphs with local detours. J. Graph Theory 30(2): 101-111 (1999) - 1998
- [j35]Alexandr V. Kostochka, Vojtech Rödl:
On Large Systems of Sets with No Large Weak <Delta>-subsystems. Comb. 18(2): 235-240 (1998) - [j34]Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril
, André Raspaud, Éric Sopena:
On universal graphs for planar oriented graphs of a given girth. Discret. Math. 188(1-3): 73-85 (1998) - [j33]N. I. Glebov, Alexandr V. Kostochka:
On the independent domination number of graphs with given minimum degree. Discret. Math. 188(1-3): 261-266 (1998) - [j32]Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall:
On kernel-perfect orientations of line graphs. Discret. Math. 191(1-3): 45-49 (1998) - [j31]Alexandr V. Kostochka, Michael Stiebitz:
Colour-critical graphs with few edges. Discret. Math. 191(1-3): 125-137 (1998) - [j30]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) - [j29]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) - [j28]Alexandr V. Kostochka, Vojtech Rödl:
Partial Steiner systems and matchings in hypergraphs. Random Struct. Algorithms 13(3-4): 335-347 (1998) - 1997
- [j27]Ervin Györi, Alexandr V. Kostochka, Tomasz Luczak
:
Graphs without short odd cycles are nearly bipartite. Discret. Math. 163(1-3): 279-284 (1997) - [j26]Alexandr V. Kostochka, Jan Kratochvíl
:
Covering and coloring polygon-circle graphs. Discret. Math. 163(1-3): 299-305 (1997) - [j25]Thomas Böhme, Hajo Broersma
, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz:
Spanning trees with pairwise nonadjacent endvertices. Discret. Math. 170(1-3): 219-222 (1997) - [j24]Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall:
List Edge and List Total Colourings of Multigraphs. J. Comb. Theory B 71(2): 184-204 (1997) - [j23]Walter A. Deuber, Paul Erdös, David S. Gunderson, Alexandr V. Kostochka, A. G. Meyer:
Intersection Statements for Systems of Sets. J. Comb. Theory A 79(1): 118-132 (1997) - [j22]Alexandr V. Kostochka, Éric Sopena, Xuding Zhu:
Acyclic and oriented chromatic numbers of graphs. J. Graph Theory 24(4): 331-340 (1997) - [j21]Alexander A. Ageev
, Alexandr V. Kostochka, Zoltán Szigeti:
A characterization of Seymour graphs. J. Graph Theory 24(4): 357-364 (1997) - [j20]Alexandr V. Kostochka, Douglas B. West:
Total interval number for graphs with bounded degree. J. Graph Theory 25(1): 79-84 (1997) - [j19]Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall:
Total colorings of planar graphs with large maximum degree. J. Graph Theory 26(1): 53-59 (1997) - 1996
- [j18]Alexandr V. Kostochka:
The total chromatic number of any multigraph with maximum degree five is at most seven. Discret. Math. 162(1-3): 199-214 (1996) - [j17]Alexandr V. Kostochka, Michael Stiebitz, Brunhilde Wirth
:
The colour theorems of Brooks and Gallai extended. Discret. Math. 162(1-3): 299-303 (1996) - [j16]Alexandr V. Kostochka:
An intersection theorem for systems of sets. Random Struct. Algorithms 9(1-2): 213-221 (1996) - 1995
- [j15]Maria Axenovich, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka:
On set systems without weak 3-Delta-subsystems. Discret. Math. 138(1-3): 57-62 (1995) - [j14]Alexandr V. Kostochka:
The 7/5-conjecture strengthens itself. J. Graph Theory 19(1): 65-67 (1995) - [j13]Alexandr V. Kostochka:
The Number of Spanning Trees in Graphs with Given Degree Sequence. Random Struct. Algorithms 6(2/3): 269-274 (1995) - 1993
- [j12]Dmitry Fon-Der-Flaass, Alexandr V. Kostochka:
Covering boxes by points. Discret. Math. 120(1-3): 269-275 (1993) - [j11]Alexandr V. Kostochka:
The independent domination number of a cubic 3-connected graph can be much larger than its domination number. Graphs Comb. 9(2-4): 235-237 (1993) - [j10]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
- [j9]Alexandr V. Kostochka:
List edge chromatic number of graphs with large girth. Discret. Math. 101(1-3): 189-201 (1992) - 1990
- [j8]Alexandr V. Kostochka:
Matchings in Random Spanning Subgraphs of Cubelike Graphs. Random Struct. Algorithms 1(3): 277-286 (1990) - 1988
- [j7]Alexandr V. Kostochka, László Pyber:
Samll topological complete subgraphs of "dense" graphs. Comb. 8(1): 83-86 (1988) - 1985
- [j6]Alexandr V. Kostochka:
Maximum set of edges no two covered by a clique. Comb. 5(3): 229-236 (1985) - 1984
- [j5]Alexandr V. Kostochka:
Lower bound of the Hadwiger number of graphs by their average degree. Comb. 4(4): 307-316 (1984) - 1982
- [j4]Alexandr V. Kostochka:
A class of constructions for Turán's (3, 4) problem. Comb. 2(2): 187-192 (1982) - 1977
- [j3]Alexandr V. Kostochka:
The total coloring of a multigraph with maximal degree 4. Discret. Math. 17(2): 161-163 (1977) - [j2]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 B 23(2-3): 247-250 (1977) - 1976
- [j1]Alexandr V. Kostochka, L. S. Mel'nikov:
Note to the paper of Grünbaum on acyclic colorings. Discret. Math. 14(4): 403-406 (1976)
Conference and Workshop Papers
- 2019
- [c5]Alexandr V. Kostochka, Xujun Liu, Roberto Assis Machado, Olgica Milenkovic:
Directed Intersection Representations and the Information Content of Digraphs. ISIT 2019: 1477-1481 - 2013
- [c4]Alexandr V. Kostochka, Matthew P. Yancey:
On Coloring of Sparse Graphs. CSR 2013: 224-234 - 2003
- [c3]Sriram V. Pemmaraju, Kittikorn Nakprasit, Alexandr V. Kostochka:
Equitable colorings with constant number of colors. SODA 2003: 458-459 - 1997
- [c2]Alexandr V. Kostochka, Tomasz Luczak, Gábor Simonyi, Éric Sopena:
On the minimum number of edges giving maximum oriented chromatic number. Contemporary Trends in Discrete Mathematics 1997: 179-182 - 1995
- [c1]Alexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti:
A Characterization of Seymour Graphs. IPCO 1995: 364-372
Parts in Books or Collections
- 2013
- [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
Informal and Other Publications
- 2013
- [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
- [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)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-06 22:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint