کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4649743 | 1342465 | 2009 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Greedily constructing maximal partial f-factors
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Let G=(V,E) be a graph and let f be a function f:VâN. A partial f-factor of G is a subgraph H of G, such that the degree in H of every vertex vâV is at most f(v). We study here the recognition problem of graphs, where all maximal partial f-factors have the same number of edges. Graphs which satisfy that property for the function f(v)â¡1 are known as equimatchable and their recognition problem is the subject of several previous articles in the literature. We show the problem is polynomially solvable if the function f is bounded by a constant, and provide a structural characterization for graphs with girth at least 5 in which all maximal partial 2-factors are of the same size.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 309, Issue 8, 28 April 2009, Pages 2180-2189
Journal: Discrete Mathematics - Volume 309, Issue 8, 28 April 2009, Pages 2180-2189
نویسندگان
David Tankus, Michael Tarsi,