کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
5776835 1413643 2017 26 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Decomposing Ku+w−Ku into cycles of prescribed lengths
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Decomposing Ku+w−Ku into cycles of prescribed lengths
چکیده انگلیسی
We prove that the complete graph with a hole Ku+w−Ku can be decomposed into cycles of arbitrary specified lengths provided that the obvious necessary conditions are satisfied, each cycle has length at most min(u,w), and the longest cycle is at most three times as long as the second longest. This generalises existing results on decomposing the complete graph with a hole into cycles of uniform length, and complements work on decomposing complete graphs, complete multigraphs, and complete multipartite graphs into cycles of arbitrary specified lengths.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 340, Issue 8, August 2017, Pages 1818-1843
نویسندگان
, ,