Füredi, Z., Kostochka, A., & Kumbhat, M. (2024). Minimal abundant packings and choosability with separation. Designs, Codes, and Cryptography, 92(12), 4189-4194. https://doi.org/10.1007/s10623-024-01484-w

Kierstead, H. A., Kostochka, A., & Xiang, Z. (Accepted/In press). Equitable List Coloring of Planar Graphs With Given Maximum Degree. Journal of Graph Theory, 108(4), 832-838. https://doi.org/10.1002/jgt.23203

Kostochka, A., Luo, R., & McCourt, G. (2024). A Hypergraph Analog of Dirac’s Theorem for Long Cycles in 2-Connected Graphs. Combinatorica, 44(4), 849-880. https://doi.org/10.1007/s00493-024-00096-1

Kostochka, A., Luo, R., & McCourt, G. (2024). Dirac-type theorems for long Berge cycles in hypergraphs. Journal of Combinatorial Theory. Series B, 168, 159-191. https://doi.org/10.1016/j.jctb.2024.05.001

Kostochka, A., Lin, D., & Xiang, Z. (2024). Equitable coloring of planar graphs with maximum degree at least eight. Discrete Mathematics, 347(6), Article 113964. https://doi.org/10.1016/j.disc.2024.113964

View all publications on Illinois Experts