Ararat Harutyunyan

Generating author description...

All published works

Action	Title	Year	Authors
+	Odd chromatic number of graph classes	2024	Rémy Belmonte Ararat Harutyunyan Noleen Köhler Nikolaos Melissinos
+	Coloring <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e23" altimg="si13.svg"><mml:mi>k</mml:mi></mml:math>-partite sparse digraphs	2024	Ararat Harutyunyan Louisa Harutyunyan Narek Hovhannisyan
+ PDF Chat	Average-case complexity of a branch-and-bound algorithm for Min Dominating Set	2023	Tom Denat Ararat Harutyunyan Nikolaos Melissinos Vangélis Th. Paschos
+	Filling crosswords is very hard	2023	Laurent Gourvès Ararat Harutyunyan Michael Lampis Nikolaos Melissinos
+	Odd Chromatic Number of Graph Classes	2023	Rémy Belmonte Ararat Harutyunyan Noleen Köhler Nikolaos Melissinos
+	Colouring complete multipartite and Kneser-type digraphs	2023	Ararat Harutyunyan Gil i
+	Odd Chromatic Number of Graph Classes	2023	Rémy Belmonte Ararat Harutyunyan Noleen Köhler Nikolaos Melissinos
+	Colouring Complete Multipartite and Kneser-type Digraphs	2023	Ararat Harutyunyan Gil Puig Surroca
+ PDF Chat	Digraph Coloring and Distance to Acyclicity	2022	Ararat Harutyunyan Michael Lampis Nikolaos Melissinos
+ PDF Chat	Filling Crosswords is Very Hard	2022	Laurent Gourvès Ararat Harutyunyan Michael Lampis Nikolaos Melissinos
+ PDF Chat	Filling Crosswords is Very Hard	2021	Laurent Gourvès Ararat Harutyunyan Michael Lampis Nikolaos Melissinos
+	Filling Crosswords Is Very Hard.	2021	Laurent Gourvès Ararat Harutyunyan Michael Lampis Nikolaos Melissinos
+ PDF Chat	Digraph Coloring and Distance to Acyclicity	2021	Ararat Harutyunyan Michael Lampis Nikolaos Melissinos
+	Filling Crosswords is Very Hard	2021	Laurent Gourvès Ararat Harutyunyan Michael Lampis Nikolaos Melissinos
+	Independent dominating sets in graphs of girth five	2020	Ararat Harutyunyan Paul Horn Jacques Verstraëte
+	Maximum independent sets in subcubic graphs: New results	2020	Ararat Harutyunyan Michael Lampis Vadim Lozin Jérôme Monnot
+ PDF Chat	Disproving the normal graph conjecture	2020	Ararat Harutyunyan Lucas Pastor Stéphan Thomassé
+	Digraph Coloring and Distance to Acyclicity	2020	Ararat Harutyunyan Michael Lampis Nikolaos Melissinos
+ PDF Chat	Coloring Dense Digraphs	2019	Ararat Harutyunyan Tien-Nam Le Alantha Newman Stéphan Thomassé
+	Coloring tournaments: From local to global	2019	Ararat Harutyunyan Tien-Nam Le Stéphan Thomassé Hehui Wu
+ PDF Chat	Disproving the normal graph conjecture	2019	Ararat Harutyunyan Lucas Pastor Stéphan Thomassé
+ PDF Chat	Maximum Independent Sets in Subcubic Graphs: New Results	2019	Ararat Harutyunyan Michael Lampis Vadim Lozin Jérôme Monnot
+	Average-case complexity of a branch-and-bound algorithm for min dominating set	2019	Tom Denat Ararat Harutyunyan Vangélis Th. Paschos
+	Maximum Independent Sets in Subcubic Graphs: New Results	2018	Ararat Harutyunyan Michael Lampis Vadim Lozin Jérôme Monnot
+	Domination and Fractional Domination in Digraphs	2018	Ararat Harutyunyan Tien-Nam Le Alantha Newman Stéphan Thomassé
+ PDF Chat	Exact Distance Colouring in Trees	2018	Nicolás Bousquet Louis Esperet Ararat Harutyunyan Rémi de Joannis de Verclos
+ PDF Chat	Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture	2018	Julien Bensmail Ararat Harutyunyan Tien-Nam Le Stéphan Thomassé
+	Maximum Independent Sets in Subcubic Graphs: New Results	2018	Ararat Harutyunyan Michael Lampis Vadim Lozin Jérôme Monnot
+	Disjoint Cycles of Different Lengths in Graphs and Digraphs	2017	Julien Bensmail Ararat Harutyunyan Ngoc Khang Le Binlong Li Nicolas Lichiardopol
+	Coloring dense digraphs	2017	Ararat Harutyunyan Tien-Nam Le Alantha Newman Stéphan Thomassé
+	Coloring dense digraphs	2017	Ararat Harutyunyan Tien-Nam Le Alantha Newman Stéphan Thomassé
+ PDF Chat	The complexity of tropical graph homomorphisms	2017	Florent Foucaud Ararat Harutyunyan Pavol Hell Sylvain Legay Yannis Manoussakis Reza Naserasr
+ PDF Chat	List coloring digraphs	2017	Julien Bensmail Ararat Harutyunyan Ngoc Khang Le
+	A proof of the Barát–Thomassen conjecture	2017	Julien Bensmail Ararat Harutyunyan Tien-Nam Le Martin Merker Stéphan Thomassé
+	Coloring tournaments: from local to global	2017	Ararat Harutyunyan Tien-Nam Le Stéphan Thomassé Hehui Wu
+	Coloring dense digraphs	2017	Ararat Harutyunyan Tien-Nam Le Alantha Newman Stéphan Thomassé
+ PDF Chat	Planar Digraphs of Digirth Five Are 2‐Colorable	2016	Ararat Harutyunyan Bojan Mohar
+	A Proof of the Barát-Thomassen Conjecture	2016	Julien Bensmail Ararat Harutyunyan Tien-Nam Le Martin Merker Stéphan Thomassé
+	A Proof of the Bar\'at-Thomassen Conjecture	2016	Julien Bensmail Ararat Harutyunyan Tien-Nam Le Martin Merker Stéphan Thomassé
+	A Proof of the Barát-Thomassen Conjecture	2016	Julien Bensmail Ararat Harutyunyan Tien-Nam Le Martin Merker Stéphan Thomassé
+	Mapping planar graphs into the Coxeter graph	2015	Ararat Harutyunyan Reza Naserasr Mirko Petruševski Riste Škrekovski Qiang Sun
+	Edge-partitioning a graph into paths: beyond the Bar\'at-Thomassen conjecture	2015	Julien Bensmail Ararat Harutyunyan Tien-Nam Le Stéphan Thomassé
+	List coloring digraphs	2015	Julien Bensmail Ararat Harutyunyan Ngoc Khang Le
+	Disproving the normal graph conjecture	2015	Ararat Harutyunyan Lucas Pastor Stéphan Thomassé
+	Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture	2015	Julien Bensmail Ararat Harutyunyan Tien-Nam Le Stéphan Thomassé
+	Strong edge-colouring of sparse planar graphs	2014	Julien Bensmail Ararat Harutyunyan Hervé Hocquard Petru Valicov
+ PDF Chat	Weak Balance in Random Signed Graphs	2014	Yannis Manoussakis Ararat Harutyunyan A. El Maftouhi
+	Strong edge-colouring of sparse planar graphs	2014	Julien Bensmail Ararat Harutyunyan Hervé Hocquard Petru Valicov
+	Strong edge-colouring of sparse planar graphs	2014	Julien Bensmail Ararat Harutyunyan Hervé Hocquard Petru Valicov
+	Planar digraphs of digirth five are 2-colorable	2014	Ararat Harutyunyan Bojan Mohar
+	Global offensive alliances in graphs and random graphs	2013	Ararat Harutyunyan
+	Two results on the digraph chromatic number	2012	Ararat Harutyunyan Bojan Mohar
+ PDF Chat	Planar Graphs Have Exponentially Many 3-Arboricities	2012	Ararat Harutyunyan Bojan Mohar
+	Planar graphs have exponentially many 3-arboricities	2011	Ararat Harutyunyan Bojan Mohar
+	Two results on the digraph chromatic number	2011	Ararat Harutyunyan Bojan Mohar
+ PDF Chat	Strengthened Brooks' Theorem for Digraphs of Girth at least Three	2011	Ararat Harutyunyan Bojan Mohar
+ PDF Chat	Uniquely <i>D</i>-colourable Digraphs with Large Girth	2011	Ararat Harutyunyan P. Mark Kayll Bojan Mohar Liam Rafferty
+	Brooks-type results for coloring of digraphs	2011	Ararat Harutyunyan
+	Strengthened Brooks Theorem for digraphs of girth three	2011	Ararat Harutyunyan Bojan Mohar
+	Gallai's Theorem for List Coloring of Digraphs	2011	Ararat Harutyunyan Bojan Mohar
+	Two results on the digraph chromatic number	2011	Ararat Harutyunyan Bojan Mohar
+	Planar graphs have exponentially many 3-arboricities	2011	Ararat Harutyunyan Bojan Mohar

Common Coauthors

Coauthor	Papers Together
Stéphan Thomassé	17
Tien-Nam Le	14
Julien Bensmail	13
Michael Lampis	12
Bojan Mohar	12
Nikolaos Melissinos	12
Alantha Newman	5
Laurent Gourvès	5
Jérôme Monnot	4
Martin Merker	4
Vadim Lozin	4
Ngoc Khang Le	3
Hervé Hocquard	3
Rémy Belmonte	3
Petru Valicov	3
Noleen Köhler	3
Lucas Pastor	3
Tom Denat	2
Hehui Wu	2
Reza Naserasr	2
Vangélis Th. Paschos	2
Yannis Manoussakis	2
P. Mark Kayll	1
Qiang Sun	1
Narek Hovhannisyan	1
Florent Foucaud	1
Mirko Petruševski	1
Louis Esperet	1
Paul Horn	1
Rémi de Joannis de Verclos	1
Pavol Hell	1
Jacques Verstraëte	1
Sylvain Legay	1
Riste Škrekovski	1
Nicolas Lichiardopol	1
Gil Puig Surroca	1
A. El Maftouhi	1
Binlong Li	1
Gil i	1
Liam Rafferty	1
Nicolás Bousquet	1
Louisa Harutyunyan	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	The dichromatic number of a digraph	1982	V. Neumann‐Lara	18
+	None	2004	Dan Archdeacon Joanna A. Ellis-Monaghan David Fisher Dalibor Fronček P. C. B. Lam Suzanne M. Seager Bing Wei Raphael Yuster	17
+	Gallai's Theorem for List Coloring of Digraphs	2011	Ararat Harutyunyan Bojan Mohar	14
+	The circular chromatic number of a digraph	2004	Drago Bokal Gašper Fijavž Martin Juvan P. Mark Kayll Bojan Mohar	12
+	None	2003	Dominique Bénard A. Bouchet R. Bruce Richter	10
+	Two results on the digraph chromatic number	2012	Ararat Harutyunyan Bojan Mohar	8
+	Eigenvalues and colorings of digraphs	2009	Bojan Mohar	8
+	Some extremal results in cochromatic and dichromatic theory	1991	Paul Erdős John Gimbel Dieter Kratsch	7
+	Strengthened Brooks Theorem for digraphs of girth three	2011	Ararat Harutyunyan Bojan Mohar	7
+ PDF Chat	On the size of induced acyclic subgraphs in random digraphs	2008	Joel Spencer C. R. Subramanian	5
+	Tournaments and colouring	2012	Eli Berger Krzysztof Choromański Maria Chudnovsky Jacob Fox Martin Loebl Alex Scott Paul Seymour Stéphan Thomassé	5
+	Tournaments with near-linear transitive subsets	2014	Krzysztof Choromański Maria Chudnovsky Paul Seymour	5
+ PDF Chat	Edge-Decomposition of Graphs into Copies of a Tree with Four Edges	2014	János Barát Dániel Gerbner	4
+ PDF Chat	Strengthened Brooks' Theorem for Digraphs of Girth at least Three	2011	Ararat Harutyunyan Bojan Mohar	4
+ PDF Chat	Domination in tournaments	2017	Maria Chudnovsky Ringi Kim Chun‐Hung Liu Paul Seymour Stéphan Thomassé	4
+ PDF Chat	The Erdös–Hajnal Conjecture—A Survey	2013	Maria Chudnovsky	4
+	Brooks-type results for coloring of digraphs	2011	Ararat Harutyunyan	4
+	None	2008	Guantao Chen Ralph J. Faudree Xuechao Li Ingo Schiermeyer	4
+	Critical Point-Arboritic Graphs	1975	Hudson V. Kronk John Mitchem	3
+	Small odd cycles in 4-chromatic graphs	2001	Tao Jiang	3
+	On circuits and subgraphs of chromatic graphs	1962	Paul Erdős	3
+ PDF Chat	Ramsey-type Theorems with Forbidden Subgraphs	2001	Noga Alon János Pach József Solymosi	3
+ PDF Chat	List coloring digraphs	2017	Julien Bensmail Ararat Harutyunyan Ngoc Khang Le	3
+	None	2006	Béla Bollobás Graham Brightwell	3
+	None	1999	Katherine Heinrich Jiping Liu Min‐Li Yu	3
+	Concentration for Independent Permutations	2002	Colin McDiarmid	3
+	On maximal independent sets of vertices in claw-free graphs	1980	George J. Minty	3
+	Chromatic number, girth and maximal degree	1978	Béla Bollobás	3
+	Algebraic Graph Theory	2009	Chris Godsil Gordon Royle	3
+	On coloring graphs with locally small chromatic number	1984	H. A. Kierstead Endre Szemerédi W. T. Trotter	3
+	Decomposing a graph into bistars	2013	Carsten Thomassen	3
+	The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem	1984	Udi Manber Martin Tompa	3
+	Coloring tournaments: From local to global	2019	Ararat Harutyunyan Tien-Nam Le Stéphan Thomassé Hehui Wu	3
+	A polynomial algorithm to find an independent set of maximum weight in a fork-free graph	2008	Vadim Lozin Martin Milanič	2
+	Color-Critical Graphs on a Fixed Surface	1997	Carsten Thomassen	2
+ PDF Chat	The Normal Graph Conjecture is True for Circulants	2006	Annegret K. Wagler	2
+ PDF Chat	A Proof of a Conjecture of Ohba	2014	Jonathan A. Noel Bruce A. Reed Hehui Wu	2
+ PDF Chat	Scrabble is PSPACE-Complete	2015	Michael Lampis Valia Mitsou Karolina Sołtys	2
+	Strong edge-coloring of planar graphs	2014	David E. Hudak Borut Lužar Roman Soták Riste S̆krekovski	2
+	Packing directed circuits	1996	Bruce Reed Neil Robertson Paul Seymour Robin Thomas	2
+	Ramsey-type theorems	1989	Paul Erdős A. Hajnal	2
+	On graphs critical with respect to edge-colourings	1981	Hian Poh Yap	2
+	The average degree of an edge-chromatic critical graph	2007	Douglas R. Woodall	2
+ PDF Chat	The choice number of random bipartite graphs	1998	Noga Alon Michael Krivelevich	2
+	On induced subgraphs with odd degrees	1994	Yair Caro	2
+	On the odd cycles of normal graphs	1999	Caterina De Simone János Körner	2
+	Probability and Computing: Randomized Algorithms and Probabilistic Analysis	2005	Michael Mitzenmacher Eli Upfal	2
+	Decomposing graphs into paths of fixed length	2013	Carsten Thomassen	2
+	On the independence number of random graphs	1990	Alan Frieze	2
+	Every Planar Graph with Maximum Degree 7 Is of Class 1	2000	Limin Zhang	2