img
img
img

Akademisyenler > Mustafa DEMİR > Yayın Detayı

Embedding an edge‐coloring of K(nr;λ1,λ2) into a Hamiltonian decomposition of K(nr+2;λ1,λ2)   
Yazarlar (2)
A. Chris Rodger
Mustafa Demir
Devamını Göster
Özet
AbstractThis paper focuses on graph decompositions of , the ‐partite multigraph in which each part has size , where two vertices in the same part or different parts are joined by exactly edges or edges respectively. Assuming one condition, necessary and sufficient conditions are found to embed a k‐edge‐coloring of into a Hamiltonian decomposition of . In the tightest case, this assumption is in fact proved to be a new necessary condition. Unlike previous results, of particular interest here is a necessary condition involving the existence of certain components in a related bipartite graph.
Anahtar Kelimeler
Makale Türü Özgün Makale
Makale Alt Türü SSCI, AHCI, SCI, SCI-Exp dergilerinde yayınlanan tam makale
Dergi Adı Journal of Graph Theory
Dergi ISSN 0364-9024 Wos Dergi Scopus Dergi
Dergi Tarandığı Indeksler SCI-Expanded
Makale Dili İngilizce
Basım Tarihi 01-2020
Cilt No 93
Sayı 1
Sayfalar 49 / 63
Doi Numarası 10.1002/jgt.22468
Makale Linki http://dx.doi.org/10.1002/jgt.22468
BM Sürdürülebilir Kalkınma Amaçları
Atıf Sayıları
Embedding an edge‐coloring of K(nr;λ1,λ2) into a Hamiltonian decomposition of K(nr+2;λ1,λ2)

Paylaş