کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4648385 | 1632438 | 2010 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Closure concept for 2-factors in claw-free graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Closure concept for 2-factors in claw-free graphs Closure concept for 2-factors in claw-free graphs](/preview/png/4648385.png)
چکیده انگلیسی
We introduce a closure concept for 2-factors in claw-free graphs that generalizes the closure introduced by the first author. The 2-factor closure of a graph is uniquely determined and the closure operation turns a claw-free graph into the line graph of a graph containing no cycles of length at most 5 and no cycles of length 6 satisfying a certain condition. A graph has a 2-factor if and only if its closure has a 2-factor; however, the closure operation preserves neither the minimum number of components of a 2-factor nor the hamiltonicity or nonhamiltonicity of a graph.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 310, Issues 10–11, 6 June 2010, Pages 1573–1579
Journal: Discrete Mathematics - Volume 310, Issues 10–11, 6 June 2010, Pages 1573–1579
نویسندگان
Zdeněk Ryjáček, Liming Xiong, Kiyoshi Yoshimoto,