| Propagation time for zero forcing on a graph L Hogben, M Huynh, N Kingsley, S Meyer, S Walker, M Young Discrete Applied Mathematics 160 (13-14), 1994-2005, 2012 | 112 | 2012 |
| Zero forcing, linear and quantum controllability for systems evolving on networks D Burgarth, D D'Alessandro, L Hogben, S Severini, M Young IEEE Transactions on Automatic Control 58 (9), 2349-2354, 2013 | 89 | 2013 |
| Positive semidefinite zero forcing J Ekstrand, C Erickson, HT Hall, D Hay, L Hogben, R Johnson, N Kingsley, ... Linear Algebra and its Applications 439 (7), 1862-1874, 2013 | 73 | 2013 |
| The anti-Ramsey number of perfect matching R Haas, M Young Discrete Mathematics 312 (5), 933-937, 2012 | 58 | 2012 |
| Logic circuits from zero forcing D Burgarth, V Giovannetti, L Hogben, S Severini, M Young Natural computing 14 (3), 485-490, 2015 | 56 | 2015 |
| Throttling zero forcing propagation speed on graphs S Butler, M Young Australasian Journal of Combinatorics 57, 65-71, 2013 | 54 | 2013 |
| Monochromatic triangles in three-coloured graphs J Cummings, D Králʼ, F Pfender, K Sperfeld, A Treglown, M Young Journal of Combinatorial Theory, Series B 103 (4), 489-503, 2013 | 48 | 2013 |
| On diamond-free subposets of the Boolean lattice L Kramer, RR Martin, M Young Journal of Combinatorial Theory, Series A 120 (3), 545-560, 2013 | 43 | 2013 |
| The inverse eigenvalue problem of a graph: Multiplicities and minors W Barrett, S Butler, SM Fallat, HT Hall, L Hogben, JCH Lin, BL Shader, ... Journal of Combinatorial Theory, Series B 142, 276-306, 2020 | 41 | 2020 |
| Rainbow triangles in three-colored graphs J Balogh, P Hu, B Lidický, F Pfender, J Volec, M Young Journal of Combinatorial Theory, Series B 126, 83-113, 2017 | 40 | 2017 |
| Anti-Ramsey number of matchings in hypergraphs L Özkahya, M Young Discrete Mathematics 313 (20), 2359-2364, 2013 | 40 | 2013 |
| Rainbow arithmetic progressions S Butler, C Erickson, L Hogben, K Hogenson, L Kramer, RL Kramer, ... arXiv preprint arXiv:1404.7232, 2014 | 34 | 2014 |
| On crossing numbers of complete tripartite and balanced complete multipartite graphs E Gethner, L Hogben, B Lidický, F Pfender, A Ruiz, M Young Journal of Graph Theory 84 (4), 552-565, 2017 | 33 | 2017 |
| On weak chromatic polynomials of mixed graphs M Beck, D Blado, J Crawford, T Jean-Louis, M Young Graphs and Combinatorics 31 (1), 91-98, 2015 | 31 | 2015 |
| Anti-van der Waerden numbers of 3-term arithmetic progressions Z Berikkyzy, A Schulte, M Young arXiv preprint arXiv:1604.08819, 2016 | 26 | 2016 |
| Note on power propagation time and lower bounds for the power domination number D Ferrero, L Hogben, FHJ Kenter, M Young Journal of Combinatorial Optimization 34 (3), 736-741, 2017 | 25 | 2017 |
| Note on power propagation time and lower bounds for the power domination number D Ferrero, L Hogben, FHJ Kenter, M Young Journal of Combinatorial Optimization 34, 736-741, 2017 | 25 | 2017 |
| The relationship between k-forcing and k-power domination D Ferrero, L Hogben, FHJ Kenter, M Young Discrete Mathematics 341 (6), 1789-1797, 2018 | 24 | 2018 |
| Rainbow arithmetic progressions in finite abelian groups M Young arXiv preprint arXiv:1603.08153, 2016 | 22 | 2016 |
| Disjoint homometric sets in graphs MO Albertson, J Pach, ME Young Ars Mathematica Contemporanea 4 (1), 2011 | 21 | 2011 |
