کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6423855 1632593 2011 7 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
2-factors in claw-free graphs
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
2-factors in claw-free graphs
چکیده انگلیسی

A graph G is said to be claw-free if G has no induced subgraph isomorphic to K1,3. We study about the minimum length of cycles in 2-factors of claw-free graphs, and we show that every claw-free graph G with minimum degree δ⩾4 has a 2-factor in which each cycle contains at least ⌈δ−12⌉ vertices and every 2-connected claw-free graph G with δ⩾3 has a 2-factor in which each cycle contains at least δ vertices.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 38, 1 December 2011, Pages 213-219
نویسندگان
, , ,