Minimum rainbow H-decompositions of graphs

ÖZKAHYA L., Person Y.

EUROPEAN JOURNAL OF COMBINATORICS, cilt.71, ss.111-124, 2018 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 71
  • Basım Tarihi: 2018
  • Doi Numarası: 10.1016/j.ejc.2018.03.002
  • Dergi Adı: EUROPEAN JOURNAL OF COMBINATORICS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.111-124
  • Hacettepe Üniversitesi Adresli: Evet

Özet

Given graphs G and H, we consider the problem of decomposing a properly edge-colored graph G into few parts consisting of rainbow copies of H and single edges. We establish a close relation to the previously studied problem of minimum H-decompositions, where an edge coloring does not matter and one is merely interested in decomposing graphs into copies of H and single edges. (C) 2018 Elsevier Ltd. All rights reserved.