On the Roots of Maximal Matching Polynomials, Matt Burnham, Aysel Erey,
Discrete Mathematics, 348(9) (2025), 114547. [doi]
On average sizes and enumeration of minimal edge covers, John Engbers, Aysel Erey,
Discrete Applied Mathematics, 371 (2025), 148-164. [doi]
Fractional Vertex Cover Reliability of Graphs, D. Brown, C. Clawson, A. Erey, R. Garcia, C. Green, D. Hein, S. Powell, Journal of Combinatorial Mathematics and Combinatorial Computing, 122 (2024), 157–172.
Extremal graphs for Widom-Rowlinson colorings in k-chromatic graphs, John Engbers, Aysel Erey,
Graphs and Combinatorics, 40 (2024), 134. [doi]
Spreading in graphs, Bostjan Bresar, Tanja Dravec, Aysel Erey, Jaka Hedzet,
Discrete Applied Mathematics, 353 (2024), 139-150. [doi][preprint]
Characterization and enumeration of 3-regular permutation graphs, Aysel Erey, Zachary Gershkoff, Amanda Lohss, Ranjan Rohatgi,
Rocky Mountain Journal of Mathematics, 55(1) (2025), 89-100. [doi]
Extremal graphs for average sizes of maximal matchings, John Engbers, Aysel Erey,
Discrete Applied Mathematics, 341 (2023), 308-321. [doi]
On the average order of a dominating set of a forest, Aysel Erey,
Discrete Mathematics, 346(1) (2023), 113127. [doi] [preprint]
Maximal distance spectral radius of 4-chromatic planar graphs, Aysel Erey,
Linear Algebra and its Applications, 618 (2021), 183-202. [doi] [preprint ]
Tomescu’s graph coloring conjecture for l-connected graphs, John Engbers, Aysel Erey, Jacob Fox, Xiaoyu He,
SIAM Journal on Discrete Mathematics, 35(2) (2021), 1478-1502. [doi] [preprint]
Uniform Length Dominating Sequence Graphs, Aysel Erey,
Graphs and Combinatorics, 36(6) (2020), 1819-1825. [doi] [preprint]
A broken cycle theorem for the restrained chromatic function, Aysel Erey,
Turkish Journal of Mathematics, 43 (2019), 355-360. [doi]
Extremal colorings and independent sets, John Engbers and Aysel Erey,
Graphs and Combinatorics, 34(6) (2018), 1347-1361. [doi] [pdf]
On the maximum number of colorings of a graph, Aysel Erey,
Journal of Combinatorics, 9(3) (2018), 489-497. [doi] [preprint]
Maximizing the number of x-colorings of 4-chromatic graphs, Aysel Erey,
Discrete Mathematics, 341(5) (2018), 1419-1431. [doi] [preprint]
On the Wiener index, distance cospectrality and transmission regular graphs, Aida Abiad, Boris Brimkov, Aysel Erey,
Lorinda Leshock, Xavier Martinez-Rivera, Suil O, Sung-Yell Song, Jason Williford,
Discrete Applied Mathematics, 230 (2017), 1-10. [doi] [preprint]
Restraints Permitting the Largest Number of Colourings, Jason Brown and Aysel Erey,
Discrete Applied Mathematics, 222 (2017), 76-88. [doi] [preprint]
On the Real Roots of σ-Polynomials, Jason Brown and Aysel Erey,
Graphs and Combinatorics, 32(5) (2016), 1723-1730. [doi] [preprint]
On the roots of σ-polynomials, Jason Brown and Aysel Erey,
Journal of Graph Theory, 82(1) (2016), 90-102. [doi] [preprint]
New Bounds for Chromatic Polynomials and Chromatic Roots, Jason Brown and Aysel Erey,
Discrete Mathematics, 338(11) (2015), 1938-1946. [doi] [preprint]
Extremal restraints for graph colourings, Jason Brown, Aysel Erey and Jian Li,
Journal of Combinatorial Mathematics and Combinatorial Computing 93 (2015), 297-304. [preprint]
A note on the real part of complex chromatic roots, Jason Brown and Aysel Erey,
Discrete Mathematics 328 (2014), 96-101. [doi] [preprint]
Block decomposition approach to compute a minimum geodetic set, Tınaz Ekim and Aysel Erey,
RAIRO Operations Research 48(04) (2014), 497-507. [doi]
Computing minimum geodetic sets of proper interval graphs,
Tınaz Ekim, Aysel Erey, Pınar Heggernes, Pim van’t Hof and Daniel Meister,
Proceedings of LATIN 2012, Lecture Notes in Computer Science, Vol. 7256, Springer, 2012, pp. 279-290. [doi]