دوره 1، شماره 2 - ( 8-1385 )
جلد 1 شماره 2 صفحات 77-65 |
برگشت به فهرست نسخه ها
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
YOUSEFI-AZARI H, GOODARZI A. 4-PLACEMENT OF ROOTED TREES. IJMSI 2006; 1 (2) :65-77
URL: http://ijmsi.ir/article-1-38-fa.html
URL: http://ijmsi.ir/article-1-38-fa.html
4-PLACEMENT OF ROOTED TREES. مجله علوم ریاضی و انفورماتیک. 1385; 1 (2) :65-77
چکیده:
A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.
| بازنشر اطلاعات | |
 |
این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |
