کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4647748 | 1342371 | 2013 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Forbidden induced subgraphs for near perfect matchings
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Let FF be a family of connected graphs. A graph GG is said to be FF-free if GG is HH-free for every graph HH in FF. Fujita et al. (2006) [2] studied the problem of characterizing the families of graphs FF such that every large enough connected FF-free graph of odd order has a near perfect matching. In the same work, the authors characterized such families FF, but in the case where every graph in FF is triangle-free. In this paper, we complete the characterization of all such families, removing the triangle-free condition.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 313, Issue 11, 6 June 2013, Pages 1267–1280
Journal: Discrete Mathematics - Volume 313, Issue 11, 6 June 2013, Pages 1267–1280
نویسندگان
Katsuhiro Ota, Kenta Ozeki, Gabriel Sueiro,