10 citations · 48 across the 31 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
cs.DM2011
Interval edge-colorings of cubic graphs
Petros A. Petrosyan
An edge-coloring of a multigraph G with colors 1,2,...,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 a…
cs.DM2011★ 4 cited
Interval edge-colorings of graph products
Petros A. Petrosyan, Hrant H. Khachatrian, Liana E. Yepremyan +1
An interval t-coloring of a graph G is a proper edge-coloring of G with colors 1,2,...,t such that at least one edge of G is colored by i, i=1,2,...,t, and the edges incident to ea…
cs.DM2011
A note on triangle-free graphs
Vahan V. Mkrtchyan, Petros A. Petrosyan
We show that if is a simple triangle-free graph with vertices, without a perfect matching, and having a minimum degree at least , then is isomorphi…