A Mathematical Model For Finding The Rainbow Connection Number

Nuriyeva F., Ugurlu O., KUTUCU H.

7th International Conference on Application of Information and Communication Technologies (AICT), Baku, Azerbaycan, 23 - 25 Ekim 2013, ss.2-4 identifier identifier

  • Cilt numarası:
  • Doi Numarası: 10.1109/icaict.2013.6722630
  • Basıldığı Şehir: Baku
  • Basıldığı Ülke: Azerbaycan
  • Sayfa Sayıları: ss.2-4


The rainbow connection problem belongs to the class of NP-Hard graph theoretical problems. The rainbow connection of a connected graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow edge-connected. In this study, we present a new mathematical model for the rainbow connection problem.