Rafael R. Kamalian

16 papers C 1Journal 15
YearRankTypeTitle / Venue / Authors
2014 J jnl
On sum edge-coloring of regular, bipartite and split graphs.
Discret. Appl. Math.
Petros A. Petrosyan, Rafael R. Kamalian
2013 J jnl
Examples of cyclically-interval non-colorable bipartite graphs
CoRR
Rafael R. Kamalian
2012 J jnl
A note on upper bounds for the maximum span in interval edge-colorings of graphs.
Discret. Math.
Rafael R. Kamalian, Petros A. Petrosyan
2012 J jnl
Estimates for the number of vertices with an interval spectrum in proper edge colorings of some graphs
CoRR
Rafael R. Kamalian
2012 J jnl
On cyclically-interval edge colorings of trees
CoRR
Rafael R. Kamalian
2012 J jnl
On sum edge-coloring of regular, bipartite and split graphs
CoRR
Petros A. Petrosyan, Rafael R. Kamalian
2011 C conf
Edge-chromatic sums of regular and bipartite graphs.
CTW
Petros A. Petrosyan, Rafael R. Kamalian
2010 J jnl
A note on interval edge-colorings of graphs
CoRR
Rafael R. Kamalian, Petros A. Petrosyan
2009 J jnl
A note on upper bounds for the maximum span in interval edge colorings of graphs
CoRR
Rafael R. Kamalian, Petros A. Petrosyan
2008 J jnl
On complexity of special maximum matchings constructing.
Discret. Math.
Rafael R. Kamalian, Vahan V. Mkrtchyan
2007 J jnl
Interval Colourings of Some Regular Graphs
CoRR
Rafael R. Kamalian, Petros A. Petrosyan
2007 J jnl
On Interval Colorings of Complete k-partite Graphs K_{n}^{k}
CoRR
Rafael R. Kamalian, Petros A. Petrosyan
2007 J jnl
On Lower Bound for W(K
CoRR
Rafael R. Kamalian, Petros A. Petrosyan
2007 J jnl
On a constructive characterization of a class of trees related to pairs of disjoint matchings
CoRR
Rafael R. Kamalian, Vahan V. Mkrtchyan
2007 J jnl
On complexity of special maximum matchings constructing
CoRR
Rafael R. Kamalian, Vahan V. Mkrtchyan
2007 J jnl
Two polynomial algorithms for special maximum matching constructing in trees
CoRR
Rafael R. Kamalian, Vahan V. Mkrtchyan