کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4651224 | 1342527 | 2006 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Packing two copies of a tree into its third power
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Packing two copies of a tree into its third power Packing two copies of a tree into its third power](/preview/png/4651224.png)
چکیده انگلیسی
A graph H of order n is said to be k-placeable into a graph G of order n, if G contains k edge-disjoint copies of H. It is well known that any non-star tree T of order n is 2-placeable into the complete graph KnKn. In the paper by Kheddouci et al. [Packing two copies of a tree into its fourth power, Discrete Math. 213 (2000) 169–178], it is proved that any non-star tree T is 2-placeable into T4T4. In this paper, we prove that any non-star tree T is 2-placeable into T3T3.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 306, Issue 21, 6 November 2006, Pages 2779–2785
Journal: Discrete Mathematics - Volume 306, Issue 21, 6 November 2006, Pages 2779–2785
نویسندگان
Atsushi Kaneko, Kazuhiro Suzuki,