Ararat Harutyunyan

From MaRDI portal
Person:418895

Available identifiers

zbMath Open harutyunyan.araratWikidataQ102411775 ScholiaQ102411775MaRDI QIDQ418895

List of research outcomes

PublicationDate of PublicationType
Filling crosswords is very hard2024-02-23Paper
https://portal.mardi4nfdi.de/entity/Q61475382024-01-15Paper
Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set}2024-01-09Paper
Colouring Complete Multipartite and Kneser-type Digraphs2023-09-28Paper
Odd Chromatic Number of Graph Classes2023-03-06Paper
Independent dominating sets in graphs of girth five2021-06-15Paper
Weak Balance in Random Signed Graphs2021-04-26Paper
On the complexity of the upper \(r\)-tolerant edge cover problem2021-03-01Paper
Disproving the normal graph conjecture2021-02-03Paper
Maximum independent sets in subcubic graphs: new results2020-11-06Paper
Exact Distance Colouring in Trees2020-03-11Paper
Maximum independent sets in subcubic graphs: new results2020-02-24Paper
Coloring dense digraphs2020-01-17Paper
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture2019-09-04Paper
Coloring tournaments: from local to global2019-07-17Paper
A proof of the Barát-Thomassen conjecture2018-10-29Paper
Domination and fractional domination in digraphs2018-09-07Paper
List coloring digraphs2018-04-27Paper
Coloring dense digraphs2018-01-18Paper
Disjoint cycles of different lengths in graphs and digraphs2017-12-12Paper
The complexity of tropical graph homomorphisms2017-07-27Paper
Planar Digraphs of Digirth Five Are 2-Colorable2017-04-21Paper
https://portal.mardi4nfdi.de/entity/Q28165162016-08-23Paper
Mapping planar graphs into the Coxeter graph2015-12-08Paper
Linear time algorithms for weighted offensive and powerful alliances in trees2015-04-29Paper
Strong edge-colouring of sparse planar graphs2014-12-03Paper
Global offensive alliances in graphs and random graphs2014-05-05Paper
Some bounds on global alliances in trees2014-04-16Paper
Planar Graphs Have Exponentially Many 3-Arboricities2013-01-04Paper
Uniquely D-colourable Digraphs with Large Girth2012-11-29Paper
Two results on the digraph chromatic number2012-05-30Paper
Gallai's Theorem for List Coloring of Digraphs2011-10-27Paper
Strengthened Brooks' theorem for digraphs of girth at least three2011-10-18Paper
A Fast Algorithm for Powerful Alliances in Trees2011-01-08Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Ararat Harutyunyan