کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
419559 | 683840 | 2010 | 19 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On well-covered triangulations: Part III
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: On well-covered triangulations: Part III On well-covered triangulations: Part III](/preview/png/419559.png)
چکیده انگلیسی
A graph GG is said to be well-covered if every maximal independent set of vertices has the same cardinality. A planar (simple) graph in which each face is a triangle is called a triangulation. It was proved in an earlier paper Finbow et al. (2004) [3] that there are no 5-connected planar well-covered triangulations, and in Finbow et al. (submitted for publication) [4] that there are exactly four 4-connected well-covered triangulations containing two adjacent vertices of degree 4. It is the aim of the present paper to complete the characterization of 4-connected well-covered triangulations by showing that each such graph contains two adjacent vertices of degree 4.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 158, Issue 8, 28 April 2010, Pages 894–912
Journal: Discrete Applied Mathematics - Volume 158, Issue 8, 28 April 2010, Pages 894–912
نویسندگان
Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer,