Hrant Khachatrian

activity

20112024

most citedMultitask learning and benchmarking with clinical time series data

688 citations · 726 across the 13 of their papers we have counts for

collaborators

Showing 2013Show all

2 papers · 1 filter

math.CO2013

Interval edge-colorings of K_{1,m,n}

Andrzej Grzesik, Hrant Khachatrian

In this note we prove that K_{1,m,n} is interval edge-colorable if and only if gcd(m+1,n+1)=1. It settles in the affirmative a conjecture of Petrosyan.

math.CO2013

Interval non-edge-colorable bipartite graphs and multigraphs

Petros A. Petrosyan, Hrant H. Khachatrian

An edge-coloring of a graph $G$ with colors $1, ..., t$ is called an interval $t$ -coloring if all colors are used, and the colors of edges incident to any vertex of $G$ are distinct…