8 citations
2 papers
cs.DM2007
Interval Colourings of Some Regular Graphs
Rafael R. Kamalian, Petros A. Petrosyan
A lower bound is obtained for the greatest possible number of colors in an interval colourings of some regular graphs.
cs.DM2007★ 8 cited
On Edge-Disjoint Pairs Of Matchings
V. V. Mkrtchyan, V. L. Musoyan, A. V. Tserunyan
For a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many edges as possible. Let H be the largest matching among such pairs. Let M be a maximum m…