THE RAINBOW CONNECTION PROBLEM: MATHEMATICAL FORMULATIONS

Basit Öğe Kaydı
dc.authoridKutucu, Hakan/0000-0001-7144-7246
dc.authoridUgurlu, Onur/0000-0003-2743-5939
dc.contributor.authorKutucu, H.
dc.contributor.authorNuriyeva, F.
dc.contributor.authorUgurlu, O.
dc.date.accessioned2024-09-29T16:11:28Z
dc.date.available2024-09-29T16:11:28Z
dc.date.issued2016
dc.departmentKarabük Üniversitesien_US
dc.description.abstractThe concept of rainbow connection was introduced by Chartrand et al. in 2008. The rainbow connection number, rc(G), of a connected graph G = (V, E) is the minimum number of colors needed to color the edges of E, so that each pair of the vertices in V is connected by at least one path in which no two edges are assigned the same color. The rainbow vertex-connection number, rvc(G), is the vertex version of this problem. In this paper, we introduce mixed integer programming models for both versions of the problem. We show the validity of the proposed models and test their efficiency using a nonlinear programming solver.en_US
dc.description.sponsorshipTUBITAK (The Scientific and Technological Research Council of Turkey) fellowshipen_US
dc.description.sponsorshipThe authors would also like to thank the anonymous referees for their valuable comments and suggestions that permitted to considerably improve the presentation of the paper. Also, O.Ugurlu was supported in part by TUBITAK (The Scientific and Technological Research Council of Turkey) fellowship.en_US
dc.identifier.endpage108en_US
dc.identifier.issn0381-7032
dc.identifier.startpage101en_US
dc.identifier.urihttps://hdl.handle.net/20.500.14619/8459
dc.identifier.volume127en_US
dc.identifier.wosWOS:000380622100009en_US
dc.identifier.wosqualityQ4en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherCharles Babbage Res Ctren_US
dc.relation.ispartofArs Combinatoriaen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectGraph theoryen_US
dc.subjectrainbow connectionen_US
dc.subjectrainbow vertex-connectionen_US
dc.subjectmathematical modelingen_US
dc.subjectmixed-integer programmingen_US
dc.titleTHE RAINBOW CONNECTION PROBLEM: MATHEMATICAL FORMULATIONSen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu