#### Filter Results:

- Full text PDF available (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Petros A. Petrosyan, Hrant Khachatrian, Tigran Mamikonyan
- 2015 Computer Science and Information…
- 2015

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 colorable if it has an interval t-coloring for some positive integer t. The set of interval colorable graphs is denoted by R. Recently,… (More)

- Hrant Khachatrian, Tigran Mamikonyan
- ArXiv
- 2015

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 colorable if it has an interval t-coloring for some positive integer t. The problem of deciding whether a bipartite graph is… (More)

- ‹
- 1
- ›