dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Rafael R. Kamalian Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRafael R. Kamalian: Estimates for the number of vertices with an interval spectrum in proper edge colorings of some graphs CoRR abs/1205.0131: (2012)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRafael R. Kamalian: On cyclically-interval edge colorings of trees CoRR abs/1205.0193: (2012)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRafael R. Kamalian, Petros A. Petrosyan: A note on upper bounds for the maximum span in interval edge-colorings of graphs. Discrete Mathematics 312(8): 1393-1399 (2012)
2011
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPetros A. Petrosyan, Rafael R. Kamalian: Edge-chromatic sums of regular and bipartite graphs. CTW 2011: 227-230
2010
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRafael R. Kamalian, Petros A. Petrosyan: A note on interval edge-colorings of graphs CoRR abs/1007.1717: (2010)
2009
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRafael R. Kamalian, Petros A. Petrosyan: A note on upper bounds for the maximum span in interval edge colorings of graphs CoRR abs/0911.5258: (2009)
2008
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRafael R. Kamalian, Vahan V. Mkrtchyan: On complexity of special maximum matchings constructing. Discrete Mathematics 308(10): 1792-1800 (2008)
2007
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRafael R. Kamalian, Vahan V. Mkrtchyan: On complexity of special maximum matchings constructing CoRR abs/0707.2126: (2007)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRafael R. Kamalian, Vahan V. Mkrtchyan: Two polynomial algorithms for special maximum matching constructing in trees CoRR abs/0707.2295: (2007)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRafael R. Kamalian, Vahan V. Mkrtchyan: On a constructive characterization of a class of trees related to pairs of disjoint matchings CoRR abs/0708.2363: (2007)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRafael R. Kamalian, Petros A. Petrosyan: On Lower Bound for W(K2n) CoRR abs/0712.2567: (2007)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRafael R. Kamalian, Petros A. Petrosyan: Interval Colourings of Some Regular Graphs CoRR abs/0712.3150: (2007)
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRafael R. Kamalian, Petros A. Petrosyan: On Interval Colorings of Complete k-partite Graphs K_{n}^{k} CoRR abs/0712.3155: (2007)

Coauthor Index

1Vahan V. Mkrtchyan [4] [5] [6] [7]
2Petros A. Petrosyan [1] [2] [3] [8] [9] [10] [11]

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page