کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9513137 | 1632457 | 2005 | 4 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A technique for multicoloring triangle-free hexagonal graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A technique for multicoloring triangle-free hexagonal graphs A technique for multicoloring triangle-free hexagonal graphs](/preview/png/9513137.png)
چکیده انگلیسی
In order to avoid interference in cellular telephone networks, sets of radio frequencies are to be assigned to transmitters such that adjacent transmitters are allotted disjoint sets of frequencies. Often these transmitters are laid out like vertices of a triangular lattice in a plane. This problem corresponds to the problem of multicoloring an induced subgraph of a triangular lattice with integer demands associated with each vertex. We deal with the simpler case of triangle-free subgraphs of the lattice. [Frédéric Havet, Discrete Math. 233 (2001) 1-3] uses inductive arguments to prove that triangle-free hexagonal graphs can be colored with 76Ïd+o(1) colors where Ïd is the maximum demand on a clique in the graph. We give a simpler proof and hope that our techniques can be used to prove the conjecture by [McDiarmid and Reed, Networks Suppl. 36 (2000) 114-117] that these graphs are 98Ïd+o(1)-multicolorable.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 300, Issues 1â3, 6 September 2005, Pages 256-259
Journal: Discrete Mathematics - Volume 300, Issues 1â3, 6 September 2005, Pages 256-259
نویسندگان
K.S. Sudeep, Sundar Vishwanathan,