Alexandr V. Kostochka

261 papers A* 1B 2Misc 1Journal 255Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
A lower bound on the number of edges in DP-critical graphs.
J. Comb. Theory B
Peter Bradshaw, Ilkyoo Choi, Alexandr V. Kostochka, Jingwei Xu
2026 J jnl
Equitable list coloring of sparse graphs.
Discret. Math.
Hal A. Kierstead, Alexandr V. Kostochka, Zimu Xiang
2026 J jnl
Ore-Type Conditions for Existence of a Jellyfish in a Graph.
J. Graph Theory
Jaehoon Kim, Alexandr V. Kostochka, Ruth Luo
2025 J jnl
A Hypergraph Analog of Dirac's Theorem for Long Cycles in 2-Connected Graphs, II: Large Uniformities.
Electron. J. Comb.
Alexandr V. Kostochka, Ruth Luo, Grace McCourt
2025 J jnl
Acyclic graphs with at least 2ℓ + 1 vertices are ℓ-recognizable.
J. Graph Theory
Alexandr V. Kostochka, Mina Nahvi, Douglas B. West, Dara Zirlin
2025 J jnl
Equitable List Coloring of Planar Graphs With Given Maximum Degree.
J. Graph Theory
Hal A. Kierstead, Alexandr V. Kostochka, Zimu Xiang
2025 J jnl
Sparse Critical Graphs for Defective (1, 3)-Coloring.
Graphs Comb.
Alexandr V. Kostochka, Jingwei Xu, Xuding Zhu
2025 J jnl
Trees with at Least 6ℓ +11 Vertices are ℓ-Reconstructible.
Graphs Comb.
Alexandr V. Kostochka, Mina Nahvi, Douglas B. West, Dara Zirlin
2025 J jnl
Turán Number for Bushes.
Electron. J. Comb.
Alexandr V. Kostochka, Zoltán Füredi
2024 J jnl
A Hypergraph Analog of Dirac's Theorem for Long Cycles in 2-Connected Graphs.
Comb.
Alexandr V. Kostochka, Ruth Luo, Grace McCourt
2024 J jnl
Dirac-type theorems for long Berge cycles in hypergraphs.
J. Comb. Theory B
Alexandr V. Kostochka, Ruth Luo, Grace McCourt
2024 J jnl
Equitable coloring of planar graphs with maximum degree at least eight.
Discret. Math.
Alexandr V. Kostochka, Duo Lin, Zimu Xiang
2024 J jnl
Minimal abundant packings and choosability with separation.
Des. Codes Cryptogr.
Zoltán Füredi, Alexandr V. Kostochka, Mohit Kumbhat
2024 J jnl
On a property of 2-connected graphs and Dirac's Theorem.
Discret. Math.
Alexandr V. Kostochka, Ruth Luo, Grace McCourt
2024 J jnl
Sharp lower bounds for the number of maximum matchings in bipartite multigraphs.
J. Graph Theory
Alexandr V. Kostochka, Douglas B. West, Zimu Xiang
2024 J jnl
Sparse critical graphs for defective DP-colorings.
Discret. Math.
Alexandr V. Kostochka, Jingwei Xu
2023 J jnl
A sharp lower bound for the spectral radius in
Discret. Math.
Jaehoon Kim, Alexandr V. Kostochka, Suil O, Yongtang Shi, Zhiwen Wang
2023 J jnl
Extremal Problems for Hypergraph Blowups of Trees.
SIAM J. Discret. Math.
Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
2023 J jnl
Generalized DP-colorings of graphs.
Discret. Math.
Alexandr V. Kostochka, Thomas Schweser, Michael Stiebitz
2023 J jnl
Minimum degree ensuring that a hypergraph is hamiltonian-connected.
Eur. J. Comb.
Alexandr V. Kostochka, Ruth Luo, Grace McCourt
2023 J jnl
Saturation for the 3-uniform loose 3-cycle.
Discret. Math.
Sean English, Alexandr V. Kostochka, Dara Zirlin
2022 J jnl
Defective DP-colorings of sparse simple graphs.
Discret. Math.
Yifan Jing, Alexandr V. Kostochka, Fuhong Ma, Jingwei Xu
2022 J jnl
Longest cycles in 3-connected hypergraphs and bipartite graphs.
J. Graph Theory
Alexandr V. Kostochka, Mikhail Lavrov, Ruth Luo, Dara Zirlin
2022 J jnl
Monochromatic connected matchings in 2-edge-colored multipartite graphs.
J. Graph Theory
József Balogh, Alexandr V. Kostochka, Mikhail Lavrov, Xujun Liu
2022 J jnl
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree.
Comb. Probab. Comput.
József Balogh, Alexandr V. Kostochka, Mikhail Lavrov, Xujun Liu
2022 J jnl
Towards the Small Quasi-Kernel Conjecture.
Electron. J. Comb.
Alexandr V. Kostochka, Ruth Luo, Songling Shan
2021 J jnl
3-regular graphs are 2-reconstructible.
Eur. J. Comb.
Alexandr V. Kostochka, Mina Nahvi, Douglas B. West, Dara Zirlin
2021 J jnl
Conditions for a Bigraph to be Super-Cyclic.
Electron. J. Comb.
Alexandr V. Kostochka, Mikhail Lavrov, Ruth Luo, Dara Zirlin
2021 J jnl
Cut-Edges and Regular Factors in Regular Graphs of Odd Degree.
Graphs Comb.
Alexandr V. Kostochka, André Raspaud, Bjarne Toft, Douglas B. West, Dara Zirlin
2021 J jnl
Defective DP-colorings of sparse multigraphs.
Eur. J. Comb.
Yifan Jing, Alexandr V. Kostochka, Fuhong Ma, Pongpat Sittitrai, Jingwei Xu
2021 J jnl
Injective edge-coloring of graphs with given maximum degree.
Eur. J. Comb.
Alexandr V. Kostochka, André Raspaud, Jingwei Xu
2021 J jnl
On 2-defective DP-colorings of sparse graphs.
Eur. J. Comb.
Alexandr V. Kostochka, Jingwei Xu
2021 J jnl
On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices.
IEEE Trans. Inf. Theory
Alexandr V. Kostochka, Douglas B. West
2021 J jnl
Packing (1, 1, 2, 4)-coloring of subcubic outerplanar graphs.
Discret. Appl. Math.
Alexandr V. Kostochka, Xujun Liu
2021 J jnl
Partitioning ordered hypergraphs.
J. Comb. Theory A
Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
2020 J jnl
Berge Cycles in Non-Uniform Hypergraphs.
Electron. J. Comb.
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
2020 J jnl
Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices.
Graphs Comb.
Alexandr V. Kostochka, Mina Nahvi, Douglas B. West, Dara Zirlin
2020 J jnl
Fractional DP-colorings of sparse graphs.
J. Graph Theory
Anton Bernshteyn, Alexandr V. Kostochka, Xuding Zhu
2020 J jnl
Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2.
Discret. Appl. Math.
Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
2020 J jnl
On r-uniform hypergraphs with circumference less than r.
Discret. Appl. Math.
Alexandr V. Kostochka, Ruth Luo
2020 J jnl
On-line DP-coloring of graphs.
Discret. Appl. Math.
Seog-Jin Kim, Alexandr V. Kostochka, Xuer Li, Xuding Zhu
2020 J jnl
Ordered and Convex Geometric Trees with Linear Extremal Function.
Discret. Comput. Geom.
Zoltán Füredi, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
2020 J jnl
Super-pancyclic hypergraphs and bipartite graphs.
J. Comb. Theory B
Alexandr V. Kostochka, Ruth Luo, Dara Zirlin
2020 J jnl
The Minimum Number of Edges in 4-Critical Digraphs of Given Order.
Graphs Comb.
Alexandr V. Kostochka, Michael Stiebitz
2020 J jnl
The minimum spectral radius of Kr+1-saturated graphs.
Discret. Math.
Jaehoon Kim, Seog-Jin Kim, Alexandr V. Kostochka, Suil O
2019 J jnl
A variation of a theorem by Pósa.
Discret. Math.
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
2019 J jnl
Avoiding long Berge cycles.
J. Comb. Theory B
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
2019 J jnl
Cubic Graphs with Small Independence Ratio.
Electron. J. Comb.
József Balogh, Alexandr V. Kostochka, Xujun Liu
2019 J jnl
DP-colorings of hypergraphs.
Eur. J. Comb.
Anton Bernshteyn, Alexandr V. Kostochka
2019 B conf
Directed Intersection Representations and the Information Content of Digraphs.
ISIT
Alexandr V. Kostochka, Xujun Liu, Roberto Assis Machado, Olgica Milenkovic
2019 J jnl
Extremal Union-Closed Set Families.
Graphs Comb.
Guantao Chen, Hein van der Holst, Alexandr V. Kostochka, Nana Li
2019 J jnl
Hypergraphs Not Containing a Tight Tree with a Bounded Trunk.
SIAM J. Discret. Math.
Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
2019 J jnl
Largest 2-Regular Subgraphs in 3-Regular Graphs.
Graphs Comb.
Ilkyoo Choi, Ringi Kim, Alexandr V. Kostochka, Boram Park, Douglas B. West
2019 J jnl
On 2-Connected Hypergraphs with No Long Cycles.
Electron. J. Comb.
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
2019 J jnl
Packing Chromatic Number of Subdivisions of Cubic Graphs.
Graphs Comb.
József Balogh, Alexandr V. Kostochka, Xujun Liu
2018 J jnl
A Brooks-Type Result for Sparse Critical Graphs.
Comb.
Alexandr V. Kostochka, Matthew P. Yancey
2018 J jnl
A Sharp Dirac-Erdős Type Bound for Large Graphs.
Comb. Probab. Comput.
Hal A. Kierstead, Alexandr V. Kostochka, Andrew McConvey
2018 J jnl
Extensions of a theorem of Erdős on nonhamiltonian graphs.
J. Graph Theory
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
2018 J jnl
List star edge-coloring of subcubic graphs.
Discuss. Math. Graph Theory
Samia Kerdjoudj, Alexandr V. Kostochka, André Raspaud
2018 J jnl
Packing chromatic number of cubic graphs.
Discret. Math.
József Balogh, Alexandr V. Kostochka, Xujun Liu
2018 J jnl
Sharp Dirac's theorem for DP-critical graphs.
J. Graph Theory
Anton Bernshteyn, Alexandr V. Kostochka
2018 J jnl
Stability in the Erdős-Gallai Theorem on cycles and paths, II.
Discret. Math.
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo, Jacques Verstraëte
2018 J jnl
Strong edge-colorings of sparse graphs with large maximum degree.
Eur. J. Comb.
Ilkyoo Choi, Jaehoon Kim, Alexandr V. Kostochka, André Raspaud
2017 J jnl
A stability version for a theorem of Erdős on nonhamiltonian graphs.
Discret. Math.
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
2017 J jnl
Cycles in triangle-free graphs of large chromatic number.
Comb.
Alexandr V. Kostochka, Benny Sudakov, Jacques Verstraëte
2017 J jnl
DP-colorings of graphs with high chromatic number.
Eur. J. Comb.
Anton Bernshteyn, Alexandr V. Kostochka, Xuding Zhu
2017 J jnl
Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2.
J. Comb. Theory B
Min Chen, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West, Xuding Zhu
2017 J jnl
On the Corrádi-Hajnal theorem and a question of Dirac.
J. Comb. Theory B
Henry A. Kierstead, Alexandr V. Kostochka, Elyse Yeager
2017 J jnl
Strengthening Theorems of Dirac and Erdős on Disjoint Cycles.
J. Graph Theory
Hal A. Kierstead, Alexandr V. Kostochka, Andrew McConvey
2017 J jnl
The (2k-1)-connected multigraphs with at most k-1 disjoint cycles.
Comb.
Henry A. Kierstead, Alexandr V. Kostochka, Elyse Yeager
2017 J jnl
Tight Descriptions of 3-Paths in Normal Plane Maps : Dedicated to Andre Raspaud on the occasion of his 70th birthday.
J. Graph Theory
Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka
2017 J jnl
Turán problems and shadows II: Trees.
J. Comb. Theory B
Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
2016 J jnl
A list version of graph packing.
Discret. Math.
Ervin Györi, Alexandr V. Kostochka, Andrew McConvey, Derrek Yager
2016 J jnl
Adding Edges to Increase the Chromatic Number of a Graph.
Comb. Probab. Comput.
Alexandr V. Kostochka, Jaroslav Nesetril
2016 J jnl
Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions.
J. Graph Theory
Jaehoon Kim, Alexandr V. Kostochka, Xuding Zhu
2016 J jnl
On a packing problem of Alon and Yuster.
Discret. Math.
Alexandr V. Kostochka, Andrew McConvey, Derrek Yager
2016 J jnl
On the number of edges in a graph with no (k+1)-connected subgraphs.
Discret. Math.
Anton Bernshteyn, Alexandr V. Kostochka
2016 J jnl
Stability in the Erdős-Gallai Theorems on cycles and paths.
J. Comb. Theory B
Zoltán Füredi, Alexandr V. Kostochka, Jacques Verstraëte
2016 J jnl
Strong chromatic index of subcubic planar multigraphs.
Eur. J. Comb.
Alexandr V. Kostochka, Xiaodong Li, Watcharintorn Ruksasakchai, Michael Santana, Tao Wang, G. Yu
2015 J jnl
A refinement of a result of Corrádi and Hajnal.
Comb.
Hal A. Kierstead, Alexandr V. Kostochka
2015 J jnl
The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges.
Eur. J. Comb.
Alexandr V. Kostochka, Benjamin Reiniger
2015 J jnl
Turán Problems and Shadows III: Expansions of Graphs.
SIAM J. Discret. Math.
Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
2015 J jnl
Turán problems and shadows I: Paths and cycles.
J. Comb. Theory A
Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
2014 J jnl
A new tool for proving Vizing's Theorem.
Discret. Math.
Alexandr V. Kostochka
2014 J jnl
Choosability with Separation of Complete Multipartite Graphs and Hypergraphs.
J. Graph Theory
Zoltán Füredi, Alexandr V. Kostochka, Mohit Kumbhat
2014 J jnl
Defective 2-colorings of sparse graphs.
J. Comb. Theory B
Oleg V. Borodin, Alexandr V. Kostochka
2014 J jnl
Describing faces in plane triangulations.
Discret. Math.
Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka
2014 J jnl
Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11.
Discret. Math.
Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka
2014 J jnl
Improper coloring of sparse graphs with a given girth, I: (0, 1)-colorings of triangle-free graphs.
Eur. J. Comb.
Jaehoon Kim, Alexandr V. Kostochka, Xuding Zhu
2014 J jnl
Ks, t Minors in (s+t)- Chromatic Graphs, II.
J. Graph Theory
Alexandr V. Kostochka
2014 J jnl
Maximum hypergraphs without regular subgraphs.
Discuss. Math. Graph Theory
Jaehoon Kim, Alexandr V. Kostochka
2014 J jnl
On independent sets in hypergraphs.
Random Struct. Algorithms
Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
2014 J jnl
Ore's conjecture for k=4 and Grötzsch's Theorem.
Comb.
Alexandr V. Kostochka, Matthew P. Yancey
2014 J jnl
Ore's conjecture on color-critical graphs is almost true.
J. Comb. Theory B
Alexandr V. Kostochka, Matthew P. Yancey
2014 J jnl
Planar 4-critical graphs with four triangles.
Eur. J. Comb.
Oleg V. Borodin, Zdenek Dvorák, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey
2014 J jnl
Short proofs of coloring theorems on planar graphs.
Eur. J. Comb.
Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey
2013 — ch.
A Bound of the Cardinality of Families Not Containing \(\Delta \) -Systems.
The Mathematics of Paul Erdős II
Alexandr V. Kostochka
2013 J jnl
A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge.
J. Graph Theory
Alexandr V. Kostochka, Christopher J. Stocker, Peter Hamburger
2013 J jnl
Coloring some finite sets in
Discuss. Math. Graph Theory
József Balogh, Alexandr V. Kostochka, Andrei M. Raigorodskii
2013 J jnl
Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree.
J. Graph Theory
Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West, Hehui Wu, Xuding Zhu
2013 J jnl
Describing 3-paths in normal plane maps.
Discret. Math.
Oleg V. Borodin, Anna O. Ivanova, Tommy R. Jensen, Alexandr V. Kostochka, Matthew P. Yancey
2013 J jnl
Equitable List Coloring of Graphs with Bounded Degree.
J. Graph Theory
Hal A. Kierstead, Alexandr V. Kostochka
2013 J jnl
Hypergraph Ramsey numbers: Triangles versus cliques.
J. Comb. Theory A
Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
2013 J jnl
On 11-improper 22-coloring of sparse graphs.
Discret. Math.
Oleg V. Borodin, Alexandr V. Kostochka, Matthew P. Yancey
2013 Misc conf
On Coloring of Sparse Graphs.
CSR
Alexandr V. Kostochka, Matthew P. Yancey
2013 J jnl
On Perfect Packings in Dense Graphs.
Electron. J. Comb.
József Balogh, Alexandr V. Kostochka, Andrew Treglown
2013 J jnl
On almost (k-1)-degenerate (k+1)-chromatic graphs and hypergraphs.
Discret. Math.
Alexandr V. Kostochka
2013 J jnl
Planar 4-critical graphs with four triangles.
CoRR
Oleg V. Borodin, Zdenek Dvorák, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey
2012 J jnl
A stability theorem on fractional covering of triangles by edges.
Eur. J. Comb.
Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé
2012 J jnl
Conflict-Free Colourings of Uniform Hypergraphs With Few Edges.
Comb. Probab. Comput.
Alexandr V. Kostochka, Mohit Kumbhat, Tomasz Luczak
2012 J jnl
Dense uniform hypergraphs have high list chromatic number.
Discret. Math.
Noga Alon, Alexandr V. Kostochka
2012 J jnl
Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring.
J. Graph Theory
Henry A. Kierstead, Alexandr V. Kostochka
2012 J jnl
Graphs Containing Every 2-Factor.
Graphs Comb.
Alexandr V. Kostochka, Gexin Yu
2012 J jnl
Graphs with chromatic number close to maximum degree.
Discret. Math.
Alexandr V. Kostochka, Landon Rabern, Michael Stiebitz
2012 J jnl
Harmonious Coloring of Trees with Large Maximum Degree
CoRR
Saieed Akbari, Jaehoon Kim, Alexandr V. Kostochka
2012 J jnl
Harmonious coloring of trees with large maximum degree.
Discret. Math.
Saieed Akbari, Jaehoon Kim, Alexandr V. Kostochka
2012 J jnl
Large Rainbow Matchings in Edge-Coloured Graphs.
Comb. Probab. Comput.
Alexandr V. Kostochka, Matthew P. Yancey
2012 J jnl
On K
Discret. Math.
Alexandr V. Kostochka, Noah Prince
2012 J jnl
Packing and Covering Triangles in K 4-free Planar Graphs.
Graphs Comb.
Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé
2012 J jnl
Short proofs of coloring theorems on planar graphs
CoRR
Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew P. Yancey
2011 J jnl
Graphs with maximum degree 5 are acyclically 7-colorable.
Ars Math. Contemp.
Alexandr V. Kostochka, Christopher J. Stocker
2011 J jnl
Hypergraph list coloring and Euclidean Ramsey theory.
Random Struct. Algorithms
Noga Alon, Alexandr V. Kostochka
2011 J jnl
Large minors in graphs with given independence number.
Discret. Math.
József Balogh, Alexandr V. Kostochka
2011 J jnl
Minors in Graphs with High Chromatic Number.
Comb. Probab. Comput.
Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason
2011 J jnl
Ohba's conjecture for graphs with independence number five.
Discret. Math.
Alexandr V. Kostochka, Michael Stiebitz, Douglas R. Woodall
2010 J jnl
A fast algorithm for equitable coloring.
Comb.
Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi
2010 J jnl
Constructions of sparse uniform hypergraphs with high chromatic number.
Random Struct. Algorithms
Alexandr V. Kostochka, Vojtech Rödl
2010 J jnl
Dense graphs have K
Discret. Math.
Alexandr V. Kostochka, Noah Prince
2010 J jnl
Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture.
Comb.
Henry A. Kierstead, Alexandr V. Kostochka
2010 J jnl
Graphs with bounded tree-width and large odd-girth are almost bipartite.
J. Comb. Theory B
Alexandr V. Kostochka, Daniel Král', Jean-Sébastien Sereni, Michael Stiebitz
2010 J jnl
Hadwiger numbers and over-dominating colourings.
Discret. Math.
Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason
2010 J jnl
On
J. Graph Theory
Alexandr V. Kostochka
2010 J jnl
Some constructive bounds on Ramsey numbers.
J. Comb. Theory B
Alexandr V. Kostochka, Pavel Pudlák, Vojtech Rödl
2009 J jnl
A Brooks-type bound for squares of K
Discret. Math.
Alexandr V. Kostochka, Lale özkahya, Douglas R. Woodall
2009 J jnl
An upper bound on the domination number of n-vertex connected cubic graphs.
Discret. Math.
Alexandr V. Kostochka, B. Y. Stodolsky
2009 J jnl
Coloring uniform hypergraphs with few edges.
Random Struct. Algorithms
Alexandr V. Kostochka, Mohit Kumbhat
2009 J jnl
Decompositions of quadrangle-free planar graphs.
Discuss. Math. Graph Theory
Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka, Naeem N. Sheikh
2009 J jnl
Efficient Graph Packing via Game Colouring.
Comb. Probab. Comput.
Hal A. Kierstead, Alexandr V. Kostochka
2009 J jnl
Induced subgraphs with distinct sizes.
Random Struct. Algorithms
Noga Alon, Alexandr V. Kostochka
2009 J jnl
Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density.
Discret. Math.
Thomas Böhme, Alexandr V. Kostochka
2009 J jnl
Ore-type conditions implying 2-factors consisting of short cycles.
Discret. Math.
Alexandr V. Kostochka, Gexin Yu
2009 J jnl
Ore-type versions of Brooks' theorem.
J. Comb. Theory B
Hal A. Kierstead, Alexandr V. Kostochka
2009 J jnl
Planar graphs decomposable into a forest and a matching.
Discret. Math.
Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka, Naeem N. Sheikh
2009 J jnl
Sizes of Induced Subgraphs of Ramsey Graphs.
Comb. Probab. Comput.
Noga Alon, József Balogh, Alexandr V. Kostochka, Wojciech Samotij
2009 J jnl
The Erdos-Lovász Tihany conjecture for quasi-line graphs.
Discret. Math.
József Balogh, Alexandr V. Kostochka, Noah Prince, Michael Stiebitz
2008 J jnl
A Short Proof of the Hajnal-Szemerédi Theorem on Equitable Colouring.
Comb. Probab. Comput.
Hal A. Kierstead, Alexandr V. Kostochka
2008 J jnl
Adapted List Coloring of Graphs and Hypergraphs.
SIAM J. Discret. Math.
Alexandr V. Kostochka, Xuding Zhu
2008 J jnl
An Ore-type theorem on equitable coloring.
J. Comb. Theory B
Hal A. Kierstead, Alexandr V. Kostochka
2008 J jnl
Decomposing a planar graph with girth 9 into a forest and a matching.
Eur. J. Comb.
Oleg V. Borodin, Alexandr V. Kostochka, Naeem N. Sheikh, Gexin Yu
2008 J jnl
Hadwiger Number and the Cartesian Product of Graphs.
Graphs Comb.
L. Sunil Chandran, Alexandr V. Kostochka, J. Krishnam Raju
2008 J jnl
Minimum degree conditions for H-linked graphs.
Discret. Appl. Math.
Alexandr V. Kostochka, Gexin Yu
2008 J jnl
On
J. Graph Theory
Nana Arizumi, Peter Hamburger, Alexandr V. Kostochka
2008 J jnl
On 2-Detour Subgraphs of the Hypercube.
Graphs Comb.
József Balogh, Alexandr V. Kostochka
2008 J jnl
On K
Discret. Math.
Alexandr V. Kostochka, Noah Prince
2008 J jnl
On a graph packing conjecture by Bollobás, Eldridge and Catlin.
Comb.
Hemanshu Kaul, Alexandr V. Kostochka, Gexin Yu
2008 J jnl
Ore-type degree conditions for a graph to be
J. Graph Theory
Alexandr V. Kostochka, Gexin Yu
2008 J jnl
Packing d-degenerate graphs.
J. Comb. Theory B
Béla Bollobás, Alexandr V. Kostochka, Kittikorn Nakprasit
2008 J jnl
Packing of graphs with small product of sizes.
J. Comb. Theory B
Alexandr V. Kostochka, Gexin Yu
2008 J jnl
Partitions and Edge Colourings of Multigraphs.
Electron. J. Comb.
Alexandr V. Kostochka, Michael Stiebitz
2008 J jnl
When is an Almost Monochromatic
Comb. Probab. Comput.
Alexandr V. Kostochka, Dhruv Mubayi
2007 J jnl
An Ore-type analogue of the Sauer-Spencer Theorem.
Graphs Comb.
Alexandr V. Kostochka, Gexin Yu
2007 J jnl
Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer.
Comb. Probab. Comput.
Hemanshu Kaul, Alexandr V. Kostochka
2007 J jnl
On Directed Triangles in Digraphs.
Electron. J. Comb.
Peter Hamburger, Penny E. Haxell, Alexandr V. Kostochka
2007 J jnl
Ore-type graph packing problems.
Comb. Probab. Comput.
Alexandr V. Kostochka, Gexin Yu
2007 J jnl
Tree representations of graphs.
Eur. J. Comb.
Nancy Eaton, Zoltán Füredi, Alexandr V. Kostochka, Jozef Skokan
2006 J jnl
Chvátal's Condition cannot hold for both a graph and its complement.
Discuss. Math. Graph Theory
Alexandr V. Kostochka, Douglas B. West
2006 J jnl
Dominating sets in k-majority tournaments.
J. Comb. Theory B
Noga Alon, Graham R. Brightwell, Hal A. Kierstead, Alexandr V. Kostochka, Peter Winkler
2006 J jnl
On Minimum Degree Implying That a Graph is H-Linked.
SIAM J. Discret. Math.
Ronald J. Gould, Alexandr V. Kostochka, Gexin Yu
2006 J jnl
On Ramsey numbers of uniform hypergraphs with given maximum degree.
J. Comb. Theory A
Alexandr V. Kostochka, Vojtech Rödl
2006 J jnl
On Sufficient Degree Conditions for a Graph to be k-linked.
Comb. Probab. Comput.
Ken-ichi Kawarabayashi, Alexandr V. Kostochka, Gexin Yu
2005 J jnl
An extremal problem for
J. Graph Theory
Alexandr V. Kostochka, Gexin Yu
2005 J jnl
Disjoint
Eur. J. Comb.
Thomas Böhme, Alexandr V. Kostochka
2005 J jnl
Even cycles in hypergraphs.
J. Comb. Theory B
Alexandr V. Kostochka, Jacques Verstraëte
2005 J jnl
Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders.
Eur. J. Comb.
Alexandr V. Kostochka, Douglas R. Woodall
2005 J jnl
Minimum degree conditions for H-linked graphs.
Electron. Notes Discret. Math.
Alexandr V. Kostochka, Gexin Yu
2005 J jnl
Nordhaus-Gaddum-type Theorems for decompositions into many parts.
J. Graph Theory
Zoltán Füredi, Alexandr V. Kostochka, Riste Skrekovski, Michael Stiebitz, Douglas B. West
2005 J jnl
On Equitable Coloring of d-Degenerate Graphs.
SIAM J. Discret. Math.
Alexandr V. Kostochka, Kittikorn Nakprasit, Sriram V. Pemmaraju
2005 J jnl
On domination in connected cubic graphs.
Discret. Math.
Alexandr V. Kostochka, B. Y. Stodolsky
2005 J jnl
On equitable
Theor. Comput. Sci.
Alexandr V. Kostochka, Kittikorn Nakprasit
2005 J jnl
Smaller planar triangle-free graphs that are not 3-list-colorable.
Discret. Math.
Alexei N. Glebov, Alexandr V. Kostochka, Vladimir A. Tashkinov
2004 J jnl
Balanced edge colorings.
J. Comb. Theory B
Paul N. Balister, Alexandr V. Kostochka, Hao Li, Richard H. Schelp
2004 J jnl
Coloring uniform hypergraphs with few colors.
Random Struct. Algorithms
Alexandr V. Kostochka
2004 J jnl
Homomorphisms from sparse graphs with large girth.
J. Comb. Theory B
Oleg V. Borodin, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West
2004 J jnl
On Graphs With Small Ramsey Numbers, II.
Comb.
Alexandr V. Kostochka, Vojtech Rödl
2004 J jnl
On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane.
Electron. J. Comb.
Seog-Jin Kim, Alexandr V. Kostochka, Kittikorn Nakprasit
2004 J jnl
Precoloring Extensions of Brooks' Theorem.
SIAM J. Discret. Math.
Michael O. Albertson, Alexandr V. Kostochka, Douglas B. West
2003 J jnl
A list analogue of equitable coloring.
J. Graph Theory
Alexandr V. Kostochka, Michael J. Pelsmajer, Douglas B. West
2003 J jnl
A new lower bound on the number of edges in colour-critical graphs and hypergraphs.
J. Comb. Theory B
Alexandr V. Kostochka, Michael Stiebitz
2003 J jnl
Decomposing Graphs into Long Paths.
Order
Alexandr V. Kostochka, Vladimir A. Tashkinov
2003 J jnl
Degree conditions for
J. Graph Theory
Ralph J. Faudree, Ronald J. Gould, Alexandr V. Kostochka, Linda M. Lesniak, Ingo Schiermeyer, Akira Saito
2003 J jnl
Equitable Colourings Of D-Degenerate Graphs.
Comb. Probab. Comput.
Alexandr V. Kostochka, Kittikorn Nakprasit
2003 A* conf
Equitable colorings with constant number of colors.
SODA
Sriram V. Pemmaraju, Kittikorn Nakprasit, Alexandr V. Kostochka
2003 J jnl
On Ramsey Numbers of Sparse Graphs.
Comb. Probab. Comput.
Alexandr V. Kostochka, Benny Sudakov
2002 J jnl
A list version of Dirac's theorem on the number of edges in colour-critical graphs.
J. Graph Theory
Alexandr V. Kostochka, Michael Stiebitz
2002 J jnl
Acyclic list 7-coloring of planar graphs.
J. Graph Theory
Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Éric Sopena
2002 J jnl
Colouring Relatives of Intervals on the Plane, II: Intervals and Rays in Two Directions.
Eur. J. Comb.
Alexandr V. Kostochka, Jaroslav Nesetril
2002 J jnl
Equitable colorings of outerplanar graphs.
Discret. Math.
Alexandr V. Kostochka
2002 J jnl
Nilpotent Families of Endomorphisms of (p(V)+, cup).
J. Comb. Theory B
Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Éric Sopena
2002 J jnl
On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs.
Electron. J. Comb.
Alexandr V. Kostochka
2002 J jnl
Total choosability of multicircuits I.
J. Graph Theory
Alexandr V. Kostochka, Douglas R. Woodall
2002 J jnl
Total choosability of multicircuits II.
J. Graph Theory
Alexandr V. Kostochka, Douglas R. Woodall
2002 J jnl
Transversals in Uniform Hypergraphs with Property (p, 2).
Comb.
Alexandr V. Kostochka
2001 J jnl
Acyclic colouring of 1-planar graphs.
Discret. Appl. Math.
Oleg V. Borodin, Alexandr V. Kostochka, André Raspaud, Éric Sopena
2001 J jnl
Choosability conjectures and multicircuits.
Discret. Math.
Alexandr V. Kostochka, Douglas R. Woodall
2001 J jnl
Colorings and homomorphisms of degenerate and bounded degree graphs.
Discret. Math.
Alexandr V. Kostochka, Jaroslav Nesetril, Petra Smolíková
2001 J jnl
Density Conditions for Panchromatic Colourings of Hypergraphs.
Comb.
Alexandr V. Kostochka, Douglas R. Woodall
2001 J jnl
On Deeply Critical Oriented Graphs.
J. Comb. Theory B
Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Éric Sopena
2001 J jnl
On graphs with small Ramsey numbers.
J. Graph Theory
Alexandr V. Kostochka, Vojtech Rödl
2001 J jnl
On nice graphs.
Discret. Math.
Pavol Hell, Alexandr V. Kostochka, André Raspaud, Éric Sopena
2001 J jnl
On the chromatic number of set systems.
Random Struct. Algorithms
Alexandr V. Kostochka, Dhruv Mubayi, Vojtech Rödl, Prasad Tetali
2001 J jnl
Sparse sets in the complements of graphs with given girth.
Discret. Math.
Alexandr V. Kostochka, Douglas R. Woodall
2000 J jnl
Colouring triangle-free intersection graphs of boxes on the plane.
Discret. Math.
Alexandr V. Kostochka, Irina G. Perepelitsa
2000 J jnl
Local and Mean Ramsey Numbers for Trees.
J. Comb. Theory B
Béla Bollobás, Alexandr V. Kostochka, Richard H. Schelp
2000 J jnl
On degrees of vertices in paradoxical trees.
Discret. Math.
Walter A. Deuber, Alexandr V. Kostochka
2000 J jnl
On the Hajo's number of graphs.
Discret. Math.
Gregory Z. Gutin, Alexandr V. Kostochka, Bjarne Toft
2000 J jnl
On the Number of Edges in Colour-Critical Graphs and Hypergraphs.
Comb.
Alexandr V. Kostochka, Michael Stiebitz
2000 J jnl
On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings.
Eur. J. Comb.
Alexandr V. Kostochka, Douglas R. Woodall
2000 J jnl
Variable degeneracy: extensions of Brooks' and Gallai's theorems.
Discret. Math.
Oleg V. Borodin, Alexandr V. Kostochka, Bjarne Toft
2000 J jnl
Vertex Set Partitions Preserving Conservativeness.
J. Comb. Theory B
Alexander A. Ageev, Alexandr V. Kostochka
1999 J jnl
Hypercube subgraphs with local detours.
J. Graph Theory
Peter Hamburger, Alexandr V. Kostochka, Alexander F. Sidorenko
1999 J jnl
On the maximum average degree and the oriented chromatic number of a graph.
Discret. Math.
Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Éric Sopena
1999 J jnl
Properties Of Descartes' Construction Of Triangle-Free Graphs With High Chromatic Number.
Comb. Probab. Comput.
Alexandr V. Kostochka, Jaroslav Nesetril
1999 J jnl
Regular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs.
Eur. J. Comb.
Noga Alon, Peter Hamburger, Alexandr V. Kostochka
1999 J jnl
Transversals in uniform hypergraphs with property (7, 2).
Discret. Math.
Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Douglas R. Woodall
1998 J jnl
Coloring Relatives of Intervals on the Plane, I: Chromatic Number Versus Girth.
Eur. J. Comb.
Alexandr V. Kostochka, Jaroslav Nesetril
1998 J jnl
Colour-critical graphs with few edges.
Discret. Math.
Alexandr V. Kostochka, Michael Stiebitz
1998 J jnl
On Large Systems of Sets with No Large Weak <Delta>-subsystems.
Comb.
Alexandr V. Kostochka, Vojtech Rödl
1998 J jnl
On kernel-perfect orientations of line graphs.
Discret. Math.
Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall
1998 J jnl
On the independent domination number of graphs with given minimum degree.
Discret. Math.
N. I. Glebov, Alexandr V. Kostochka
1998 J jnl
On universal graphs for planar oriented graphs of a given girth.
Discret. Math.
Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Éric Sopena
1998 J jnl
Partial Steiner systems and matchings in hypergraphs.
Random Struct. Algorithms
Alexandr V. Kostochka, Vojtech Rödl
1998 J jnl
Total Colourings of Planar Graphs with Large Girth.
Eur. J. Comb.
Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall
1997 J jnl
A characterization of Seymour graphs.
J. Graph Theory
Alexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti
1997 J jnl
Acyclic and oriented chromatic numbers of graphs.
J. Graph Theory
Alexandr V. Kostochka, Éric Sopena, Xuding Zhu
1997 J jnl
Covering and coloring polygon-circle graphs.
Discret. Math.
Alexandr V. Kostochka, Jan Kratochvíl
1997 J jnl
Graphs without short odd cycles are nearly bipartite.
Discret. Math.
Ervin Györi, Alexandr V. Kostochka, Tomasz Luczak
1997 J jnl
Intersection Statements for Systems of Sets.
J. Comb. Theory A
Walter A. Deuber, Paul Erdös, David S. Gunderson, Alexandr V. Kostochka, A. G. Meyer
1997 J jnl
List Edge and List Total Colourings of Multigraphs.
J. Comb. Theory B
Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall
1997 — conf
On the minimum number of edges giving maximum oriented chromatic number.
Contemporary Trends in Discrete Mathematics
Alexandr V. Kostochka, Tomasz Luczak, Gábor Simonyi, Éric Sopena
1997 J jnl
Spanning trees with pairwise nonadjacent endvertices.
Discret. Math.
Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz
1997 J jnl
Total colorings of planar graphs with large maximum degree.
J. Graph Theory
Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall
1997 J jnl
Total interval number for graphs with bounded degree.
J. Graph Theory
Alexandr V. Kostochka, Douglas B. West
1996 J jnl
An intersection theorem for systems of sets.
Random Struct. Algorithms
Alexandr V. Kostochka
1996 J jnl
The colour theorems of Brooks and Gallai extended.
Discret. Math.
Alexandr V. Kostochka, Michael Stiebitz, Brunhilde Wirth
1996 J jnl
The total chromatic number of any multigraph with maximum degree five is at most seven.
Discret. Math.
Alexandr V. Kostochka
1995 B conf
A Characterization of Seymour Graphs.
IPCO
Alexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti
1995 J jnl
On set systems without weak 3-Delta-subsystems.
Discret. Math.
Maria Axenovich, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka
1995 J jnl
The 7/5-conjecture strengthens itself.
J. Graph Theory
Alexandr V. Kostochka
1995 J jnl
The Number of Spanning Trees in Graphs with Given Degree Sequence.
Random Struct. Algorithms
Alexandr V. Kostochka
1993 J jnl
Covering boxes by points.
Discret. Math.
Dmitry Fon-Der-Flaass, Alexandr V. Kostochka
1993 J jnl
Radius and Diameter of Random Subgraphs of the Hypercube.
Random Struct. Algorithms
Alexandr V. Kostochka, Alexander A. Sapozhenko, K. Weber
1993 J jnl
The independent domination number of a cubic 3-connected graph can be much larger than its domination number.
Graphs Comb.
Alexandr V. Kostochka
1992 J jnl
List edge chromatic number of graphs with large girth.
Discret. Math.
Alexandr V. Kostochka
1990 J jnl
Matchings in Random Spanning Subgraphs of Cubelike Graphs.
Random Struct. Algorithms
Alexandr V. Kostochka
1988 J jnl
Samll topological complete subgraphs of "dense" graphs.
Comb.
Alexandr V. Kostochka, László Pyber
1985 J jnl
Maximum set of edges no two covered by a clique.
Comb.
Alexandr V. Kostochka
1984 J jnl
Lower bound of the Hadwiger number of graphs by their average degree.
Comb.
Alexandr V. Kostochka
1982 J jnl
A class of constructions for Turán's (3, 4) problem.
Comb.
Alexandr V. Kostochka
1977 J jnl
On an upper bound of a graph's chromatic number, depending on the graph's degree and density.
J. Comb. Theory B
Oleg V. Borodin, Alexandr V. Kostochka
1977 J jnl
The total coloring of a multigraph with maximal degree 4.
Discret. Math.
Alexandr V. Kostochka
1976 J jnl
Note to the paper of Grünbaum on acyclic colorings.
Discret. Math.
Alexandr V. Kostochka, L. S. Mel'nikov