Ararat Harutyunyan

Available identifiers

zbMath Open harutyunyan.araratWikidataQ102411775 ScholiaQ102411775MaRDI QIDQ418895

List of research outcomes

Publication	Date of Publication	Type
Filling crosswords is very hard	2024-02-23	Paper
https://portal.mardi4nfdi.de/entity/Q6147538	2024-01-15	Paper
Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set}	2024-01-09	Paper
Colouring Complete Multipartite and Kneser-type Digraphs	2023-09-28	Paper
Odd Chromatic Number of Graph Classes	2023-03-06	Paper
Independent dominating sets in graphs of girth five	2021-06-15	Paper
Weak Balance in Random Signed Graphs	2021-04-26	Paper
On the complexity of the upper \(r\)-tolerant edge cover problem	2021-03-01	Paper
Disproving the normal graph conjecture	2021-02-03	Paper
Maximum independent sets in subcubic graphs: new results	2020-11-06	Paper
Exact Distance Colouring in Trees	2020-03-11	Paper
Maximum independent sets in subcubic graphs: new results	2020-02-24	Paper
Coloring dense digraphs	2020-01-17	Paper
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture	2019-09-04	Paper
Coloring tournaments: from local to global	2019-07-17	Paper
A proof of the Barát-Thomassen conjecture	2018-10-29	Paper
Domination and fractional domination in digraphs	2018-09-07	Paper
List coloring digraphs	2018-04-27	Paper
Coloring dense digraphs	2018-01-18	Paper
Disjoint cycles of different lengths in graphs and digraphs	2017-12-12	Paper
The complexity of tropical graph homomorphisms	2017-07-27	Paper
Planar Digraphs of Digirth Five Are 2-Colorable	2017-04-21	Paper
https://portal.mardi4nfdi.de/entity/Q2816516	2016-08-23	Paper
Mapping planar graphs into the Coxeter graph	2015-12-08	Paper
Linear time algorithms for weighted offensive and powerful alliances in trees	2015-04-29	Paper
Strong edge-colouring of sparse planar graphs	2014-12-03	Paper
Global offensive alliances in graphs and random graphs	2014-05-05	Paper
Some bounds on global alliances in trees	2014-04-16	Paper
Planar Graphs Have Exponentially Many 3-Arboricities	2013-01-04	Paper
Uniquely D-colourable Digraphs with Large Girth	2012-11-29	Paper
Two results on the digraph chromatic number	2012-05-30	Paper
Gallai's Theorem for List Coloring of Digraphs	2011-10-27	Paper
Strengthened Brooks' theorem for digraphs of girth at least three	2011-10-18	Paper
A Fast Algorithm for Powerful Alliances in Trees	2011-01-08	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Ararat Harutyunyan