×

Harutyunyan, Ararat

Author ID: harutyunyan.ararat Recent zbMATH articles by "Harutyunyan, Ararat"
Published as: Harutyunyan, Ararat; Harutyunyan, A.
External Links: MGP

Publications by Year

Citations contained in zbMATH Open

27 Publications have been cited 154 times in 117 Documents Cited by Year
Two results on the digraph chromatic number. Zbl 1242.05095
Harutyunyan, Ararat; Mohar, Bojan
16
2012
Strong edge-colouring of sparse planar graphs. Zbl 1303.05057
Bensmail, Julien; Harutyunyan, Ararat; Hocquard, Hervé; Valicov, Petru
15
2014
Disjoint cycles of different lengths in graphs and digraphs. Zbl 1376.05038
Bensmail, Julien; Harutyunyan, Ararat; Le, Ngoc Khang; Li, Binlong; Lichiardopol, Nicolas
13
2017
Gallai’s theorem for list coloring of digraphs. Zbl 1330.05068
Harutyunyan, Ararat; Mohar, Bojan
10
2011
Strengthened Brooks’ theorem for digraphs of girth at least three. Zbl 1230.05129
Harutyunyan, Ararat; Mohar, Bojan
10
2011
List coloring digraphs. Zbl 1386.05052
Bensmail, Julien; Harutyunyan, Ararat; Le, Ngoc Khang
8
2018
Connected tropical subgraphs in vertex-colored graphs. Zbl 1343.05085
Anglès d’Auriac, Jean-Alexandre; Cohen, Nathann; El Mafthoui, Hakim; Harutyunyan, Ararat; Legay, Sylvain; Manoussakis, Yannis
8
2016
Planar digraphs of digirth five are 2-colorable. Zbl 1359.05052
Harutyunyan, Ararat; Mohar, Bojan
7
2017
Coloring tournaments: from local to global. Zbl 1415.05064
Harutyunyan, Ararat; Le, Tien-Nam; Thomassé, Stéphan; Wu, Hehui
7
2019
Uniquely \(D\)-colourable digraphs with large girth. Zbl 1254.05057
Harutyunyan, Ararat; Kayll, P. Mark; Mohar, Bojan; Rafferty, Liam
6
2012
Exact distance colouring in trees. Zbl 1434.05049
Bousquet, Nicolas; Esperet, Louis; Harutyunyan, Ararat; De Joannis De Verclos, Rémi
6
2019
Some bounds on global alliances in trees. Zbl 1287.05024
Harutyunyan, Ararat
6
2013
A proof of the Barát-Thomassen conjecture. Zbl 1398.05158
Bensmail, Julien; Harutyunyan, Ararat; Le, Tien-Nam; Merker, Martin; Thomassé, Stéphan
6
2017
Coloring dense digraphs. Zbl 1449.05095
Harutyunyan, Ararat; Le, Tien-Nam; Newman, Alantha; Thomassé, Stéphan
5
2019
The complexity of tropical graph homomorphisms. Zbl 1367.05141
Foucaud, Florent; Harutyunyan, Ararat; Hell, Pavol; Legay, Sylvain; Manoussakis, Yannis; Naserasr, Reza
4
2017
A fast algorithm for powerful alliances in trees. Zbl 1311.05189
Harutyunyan, Ararat
4
2010
Global offensive alliances in graphs and random graphs. Zbl 1288.05191
Harutyunyan, Ararat
4
2014
On the complexity of the upper \(r\)-tolerant edge cover problem. Zbl 07316481
Harutyunyan, Ararat; Khosravian Ghadikolaei, Mehdi; Melissinos, Nikolaos; Monnot, Jérôme; Pagourtzis, Aris
4
2020
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture. Zbl 1438.05144
Bensmail, Julien; Harutyunyan, Ararat; Le, Tien-Nam; Thomassé, Stéphan
4
2019
Domination and fractional domination in digraphs. Zbl 1395.05069
Harutyunyan, Ararat; Le, Tien-Nam; Newman, Alantha; Thomasse, Stéphan
3
2018
Independent dominating sets in graphs of girth five. Zbl 1466.05165
Harutyunyan, Ararat; Horn, Paul; Verstraete, Jacques
2
2021
Coloring dense digraphs. Zbl 1379.05035
Harutyunyan, Ararat; Le, Tien-Nam; Newman, Alantha; Thomassé, Stéphan
1
2017
Linear time algorithms for weighted offensive and powerful alliances in trees. Zbl 1310.68164
Harutyunyan, Ararat; Legay, Sylvain
1
2015
Maximum independent sets in subcubic graphs: new results. Zbl 1464.68285
Harutyunyan, A.; Lampis, M.; Lozin, V.; Monnot, J.
1
2020
Disproving the normal graph conjecture. Zbl 1458.05213
Harutyunyan, Ararat; Pastor, Lucas; Thomassé, Stéphan
1
2021
Weak balance in random signed graphs. Zbl 1461.05185
El Maftouhi, Abdelhakim; Harutyunyan, Ararat; Manoussakis, Yannis
1
2015
Maximum independent sets in subcubic graphs: new results. Zbl 1464.68286
Harutyunyan, Ararat; Lampis, Michael; Lozin, Vadim; Monnot, Jérôme
1
2019
Independent dominating sets in graphs of girth five. Zbl 1466.05165
Harutyunyan, Ararat; Horn, Paul; Verstraete, Jacques
2
2021
Disproving the normal graph conjecture. Zbl 1458.05213
Harutyunyan, Ararat; Pastor, Lucas; Thomassé, Stéphan
1
2021
On the complexity of the upper \(r\)-tolerant edge cover problem. Zbl 07316481
Harutyunyan, Ararat; Khosravian Ghadikolaei, Mehdi; Melissinos, Nikolaos; Monnot, Jérôme; Pagourtzis, Aris
4
2020
Maximum independent sets in subcubic graphs: new results. Zbl 1464.68285
Harutyunyan, A.; Lampis, M.; Lozin, V.; Monnot, J.
1
2020
Coloring tournaments: from local to global. Zbl 1415.05064
Harutyunyan, Ararat; Le, Tien-Nam; Thomassé, Stéphan; Wu, Hehui
7
2019
Exact distance colouring in trees. Zbl 1434.05049
Bousquet, Nicolas; Esperet, Louis; Harutyunyan, Ararat; De Joannis De Verclos, Rémi
6
2019
Coloring dense digraphs. Zbl 1449.05095
Harutyunyan, Ararat; Le, Tien-Nam; Newman, Alantha; Thomassé, Stéphan
5
2019
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture. Zbl 1438.05144
Bensmail, Julien; Harutyunyan, Ararat; Le, Tien-Nam; Thomassé, Stéphan
4
2019
Maximum independent sets in subcubic graphs: new results. Zbl 1464.68286
Harutyunyan, Ararat; Lampis, Michael; Lozin, Vadim; Monnot, Jérôme
1
2019
List coloring digraphs. Zbl 1386.05052
Bensmail, Julien; Harutyunyan, Ararat; Le, Ngoc Khang
8
2018
Domination and fractional domination in digraphs. Zbl 1395.05069
Harutyunyan, Ararat; Le, Tien-Nam; Newman, Alantha; Thomasse, Stéphan
3
2018
Disjoint cycles of different lengths in graphs and digraphs. Zbl 1376.05038
Bensmail, Julien; Harutyunyan, Ararat; Le, Ngoc Khang; Li, Binlong; Lichiardopol, Nicolas
13
2017
Planar digraphs of digirth five are 2-colorable. Zbl 1359.05052
Harutyunyan, Ararat; Mohar, Bojan
7
2017
A proof of the Barát-Thomassen conjecture. Zbl 1398.05158
Bensmail, Julien; Harutyunyan, Ararat; Le, Tien-Nam; Merker, Martin; Thomassé, Stéphan
6
2017
The complexity of tropical graph homomorphisms. Zbl 1367.05141
Foucaud, Florent; Harutyunyan, Ararat; Hell, Pavol; Legay, Sylvain; Manoussakis, Yannis; Naserasr, Reza
4
2017
Coloring dense digraphs. Zbl 1379.05035
Harutyunyan, Ararat; Le, Tien-Nam; Newman, Alantha; Thomassé, Stéphan
1
2017
Connected tropical subgraphs in vertex-colored graphs. Zbl 1343.05085
Anglès d’Auriac, Jean-Alexandre; Cohen, Nathann; El Mafthoui, Hakim; Harutyunyan, Ararat; Legay, Sylvain; Manoussakis, Yannis
8
2016
Linear time algorithms for weighted offensive and powerful alliances in trees. Zbl 1310.68164
Harutyunyan, Ararat; Legay, Sylvain
1
2015
Weak balance in random signed graphs. Zbl 1461.05185
El Maftouhi, Abdelhakim; Harutyunyan, Ararat; Manoussakis, Yannis
1
2015
Strong edge-colouring of sparse planar graphs. Zbl 1303.05057
Bensmail, Julien; Harutyunyan, Ararat; Hocquard, Hervé; Valicov, Petru
15
2014
Global offensive alliances in graphs and random graphs. Zbl 1288.05191
Harutyunyan, Ararat
4
2014
Some bounds on global alliances in trees. Zbl 1287.05024
Harutyunyan, Ararat
6
2013
Two results on the digraph chromatic number. Zbl 1242.05095
Harutyunyan, Ararat; Mohar, Bojan
16
2012
Uniquely \(D\)-colourable digraphs with large girth. Zbl 1254.05057
Harutyunyan, Ararat; Kayll, P. Mark; Mohar, Bojan; Rafferty, Liam
6
2012
Gallai’s theorem for list coloring of digraphs. Zbl 1330.05068
Harutyunyan, Ararat; Mohar, Bojan
10
2011
Strengthened Brooks’ theorem for digraphs of girth at least three. Zbl 1230.05129
Harutyunyan, Ararat; Mohar, Bojan
10
2011
A fast algorithm for powerful alliances in trees. Zbl 1311.05189
Harutyunyan, Ararat
4
2010
all top 5

Cited by 213 Authors

7 Aboulker, Pierre
6 Harutyunyan, Ararat
5 Manoussakis, Yannis G.
5 Steiner, Raphael
4 Aubian, Guillaume
4 Le, Tien-Nam
4 Mohar, Bojan
4 Stiebitz, Michael
4 Thomassé, Stéphan
4 Yan, Jin
3 Bang-Jensen, Jørgen
3 Brešar, Boštjan
3 Charbit, Pierre
3 Hedetniemi, Stephen Travis
3 Hochstättler, Winfried
3 Hocquard, Hervé
3 Knauer, Kolja B.
3 Kostochka, Aleksandr Vasil’evich
3 Kratsch, Dieter
3 Lampis, Michael
3 Liedloff, Mathieu
3 Monnot, Jérôme
3 Naserasr, Reza
3 Schweser, Thomas
3 Tan, Ngo Dac
3 Wu, Hehui
2 Bensmail, Julien
2 Chapelle, Mathieu
2 Chen, Min
2 Choi, Ilkyoo
2 Cochefert, Manfred
2 Cohen, Johanne
2 Delcourt, Michelle
2 Deng, Kecai
2 Dublois, Louis
2 Fernau, Henning
2 Foucaud, Florent
2 Golowich, Noah
2 Hanaka, Tesshu
2 Havet, Frédéric
2 Haynes, Teresa W.
2 Hell, Pavol
2 Hung, Le Xuan
2 Jafari Rad, Nader
2 Kayll, Peter Mark
2 Khosravian Ghadikolaei, Mehdi
2 Klavžar, Sandi
2 Klimošová, Tereza
2 Legay, Sylvain
2 Letourneur, Romain
2 Lewoń, Robert
2 Ma, Fuhong
2 Małafiejska, Anna
2 Małafiejski, Michał
2 Melissinos, Nikolaos
2 Narayanan, Narayanan
2 Olsen, Mika
2 Pham, Hong Phong
2 Postle, Luke
2 Sopena, Éric
2 Szabó, Tibor
2 Tuza, Zsolt
2 Valicov, Petru
2 Yu, Gexin
2 Zhou, Xiangqian
1 Anastos, Michael
1 Anderson, Sarah E.
1 Anglès d’Auriac, Jean-Alexandre
1 Araujo-Pardo, Gabriela
1 Axenovich, Maria A.
1 Bai, Yandong
1 Belhoul, Yacine
1 Bellitto, Thomas
1 Berry, Anne
1 Bliznets, Ivan A.
1 Bonamy, Marthe
1 Botler, Fábio
1 Bujtás, Csilla
1 Caro, Yair
1 Casel, Katrin
1 Chang, An
1 Chang, Gerard Jennhwa
1 Chen, Bin
1 Chen, Dong
1 Chen, Lily
1 Chen, Zhibin
1 Cho, Eun-Kyung
1 Cook, Linda
1 Czap, Július
1 Dross, François
1 Duh, Guan-Huei
1 El Maftouhi, Abdelhakim
1 Escoffier, Bruno
1 Esperet, Louis
1 Feder, Tomás
1 Felsner, Stefan
1 Gastineau, Nicolas
1 Girão, António
1 Gishboliner, Lior
1 Gourvès, Laurent
...and 113 more Authors

Citations by Year