# Tigran Mamikonyan

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.

Learn More

An edge-coloring of a graph G with colors 1,. .. , t is an interval t-coloring if all colors are used, and the colors of edges incident to each vertex of G are distinct and form an interval of integers. A graph G is interval col-orable if it has an interval t-coloring for some positive integer t. The problem of deciding whether a bipartite graph is interval… (More)

- ‹
- 1
- ›