کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4647570 1342359 2013 5 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Covering a cubic graph with perfect matchings
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Covering a cubic graph with perfect matchings
چکیده انگلیسی
Let G be a bridgeless cubic graph. A well-known conjecture of Berge and Fulkerson can be stated as follows: there exist five perfect matchings of G such that each edge of G is contained in at least one of them. Here, we prove that in each bridgeless cubic graph there exist five perfect matchings covering a portion of the edges at least equal to 215231. By a generalization of this result, we decrease the best known upper bound, expressed in terms of the size of the graph, for the number of perfect matchings needed to cover the edge-set of G.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 313, Issue 20, 28 October 2013, Pages 2292-2296
نویسندگان
,