| Local envy-freeness in house allocation problems A Beynier, Y Chevaleyre, L Gourvès, A Harutyunyan, J Lesca, N Maudet, ... Autonomous Agents and Multi-Agent Systems 33, 591-627, 2019 | 60 | 2019 |
| Two results on the digraph chromatic number A Harutyunyan, B Mohar Discrete Mathematics 312 (10), 1823-1826, 2012 | 45 | 2012 |
| Strong edge-colouring of sparse planar graphs J Bensmail, A Harutyunyan, H Hocquard, P Valicov Discrete Applied Mathematics 179, 229-234, 2014 | 37 | 2014 |
| Gallai's theorem for list coloring of digraphs A Harutyunyan, B Mohar SIAM Journal on Discrete Mathematics 25 (1), 170-180, 2011 | 33 | 2011 |
| List coloring digraphs J Bensmail, A Harutyunyan, NK Le Journal of Graph Theory 87 (4), 492-508, 2018 | 31 | 2018 |
| Strengthened Brooks Theorem for digraphs of girth three A Harutyunyan, B Mohar arXiv preprint arXiv:1110.4896, 2011 | 30 | 2011 |
| Coloring tournaments: From local to global A Harutyunyan, TN Le, S Thomassé, H Wu Journal of Combinatorial Theory, Series B 138, 166-171, 2019 | 24 | 2019 |
| Brooks-type results for coloring of digraphs A Harutyunyan Simon Fraser University, 2011 | 24 | 2011 |
| A proof of the Barát–Thomassen conjecture J Bensmail, A Harutyunyan, TN Le, M Merker, S Thomassé Journal of Combinatorial Theory, Series B 124, 39-55, 2017 | 23 | 2017 |
| Exact distance colouring in trees N Bousquet, L Esperet, A Harutyunyan, RJ de Verclos Combinatorics, Probability and Computing 28 (2), 177-186, 2019 | 18 | 2019 |
| Planar digraphs of digirth five are 2‐colorable A Harutyunyan, B Mohar Journal of Graph Theory 84 (4), 408-427, 2017 | 18 | 2017 |
| Coloring dense digraphs A Harutyunyan, TN Le, A Newman, S Thomassé Combinatorica 39, 1021-1053, 2019 | 16 | 2019 |
| Uniquely D-colourable Digraphs with Large Girth A Harutyunyan, PM Kayll, B Mohar, L Rafferty Canadian Journal of Mathematics 64 (6), 1310-1328, 2012 | 16 | 2012 |
| Connected tropical subgraphs in vertex-colored graphs JAA d'Auriac, N Cohen, H El Mafthoui, A Harutyunyan, S Legay, ... Discrete Mathematics & Theoretical Computer Science 17 (Graph Theory), 2016 | 14 | 2016 |
| Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture J Bensmail, A Harutyunyan, TN Le, S Thomassé Combinatorica 39 (2), 239-263, 2019 | 13 | 2019 |
| Domination and fractional domination in digraphs A Harutyunyan, TN Le, A Newman, S Thomassé arXiv preprint arXiv:1708.00423, 2017 | 9 | 2017 |
| Global offensive alliances in graphs and random graphs A Harutyunyan Discrete Applied Mathematics 164, 522-526, 2014 | 9 | 2014 |
| Some bounds on global alliances in trees A Harutyunyan Discrete Applied Mathematics 161 (12), 1739-1746, 2013 | 9 | 2013 |
| Digraph coloring and distance to acyclicity A Harutyunyan, M Lampis, N Melissinos Theory of Computing Systems, 1-28, 2022 | 8 | 2022 |
| Maximum independent sets in subcubic graphs: New results A Harutyunyan, M Lampis, V Lozin, J Monnot Theoretical Computer Science 846, 14-26, 2020 | 8 | 2020 |
