The following pages link to Ararat Harutyunyan (Q418895):
Displayed 33 items.
- Two results on the digraph chromatic number (Q418896) (← links)
- Strong edge-colouring of sparse planar graphs (Q477354) (← links)
- Strengthened Brooks' theorem for digraphs of girth at least three (Q640457) (← links)
- Mapping planar graphs into the Coxeter graph (Q898148) (← links)
- Domination and fractional domination in digraphs (Q1671654) (← links)
- Disjoint cycles of different lengths in graphs and digraphs (Q1684653) (← links)
- A proof of the Barát-Thomassen conjecture (Q1989951) (← links)
- On the complexity of the upper \(r\)-tolerant edge cover problem (Q1997258) (← links)
- The complexity of tropical graph homomorphisms (Q2012054) (← links)
- Disproving the normal graph conjecture (Q2222050) (← links)
- Coloring tournaments: from local to global (Q2312616) (← links)
- Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture (Q2322499) (← links)
- Linear time algorithms for weighted offensive and powerful alliances in trees (Q2342667) (← links)
- Some bounds on global alliances in trees (Q2446301) (← links)
- Global offensive alliances in graphs and random graphs (Q2448887) (← links)
- (Q2816516) (← links)
- Planar Digraphs of Digirth Five Are 2-Colorable (Q2978182) (← links)
- A Fast Algorithm for Powerful Alliances in Trees (Q3066142) (← links)
- Gallai's Theorem for List Coloring of Digraphs (Q3094906) (← links)
- Uniquely <i>D</i>-colourable Digraphs with Large Girth (Q3143310) (← links)
- List coloring digraphs (Q4638642) (← links)
- Planar Graphs Have Exponentially Many 3-Arboricities (Q4899062) (← links)
- Weak Balance in Random Signed Graphs (Q4985778) (← links)
- Independent dominating sets in graphs of girth five (Q4993127) (← links)
- Exact Distance Colouring in Trees (Q5219316) (← links)
- Coloring dense digraphs (Q5915818) (← links)
- Maximum independent sets in subcubic graphs: new results (Q5919020) (← links)
- Coloring dense digraphs (Q5919339) (← links)
- Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set} (Q6145803) (← links)
- (Q6147538) (← links)
- Filling crosswords is very hard (Q6199399) (← links)
- Odd Chromatic Number of Graph Classes (Q6428533) (← links)
- Colouring Complete Multipartite and Kneser-type Digraphs (Q6453016) (← links)