کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4649815 1342467 2009 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Path and cycle decompositions of complete equipartite graphs: Four parts
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Path and cycle decompositions of complete equipartite graphs: Four parts
چکیده انگلیسی

We show that a complete equipartite graph with four partite sets has an edge-disjoint decomposition into cycles of length kk if and only if k≥3k≥3, the partite set size is even, kk divides the number of edges in the equipartite graph and the total number of vertices in the graph is at least kk. We also show that a complete equipartite graph with four even   partite sets has an edge-disjoint decomposition into paths with kk edges if and only if kk divides the number of edges in the equipartite graph and the total number of vertices in the graph is at least k+1k+1.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 309, Issue 10, 28 May 2009, Pages 3061–3073
نویسندگان
, , ,