کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4949922 | 1440206 | 2016 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Grünbaum colorings of triangulations on the projective plane
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Grünbaum colorings of triangulations on the projective plane Grünbaum colorings of triangulations on the projective plane](/preview/png/4949922.png)
چکیده انگلیسی
A Grünbaum coloring of a triangulation G on a surface is a 3-edge coloring of G such that each face of G receives three distinct colors on its boundary edges. In this paper, we prove that every Fisk triangulation on the projective plane P has a Grünbaum coloring, where a “Fisk triangulation” is one with exactly two odd degree vertices such that the two odd vertices are adjacent. To prove the theorem, we establish a generating theorem for Fisk triangulations on P. Moreover, we show that a triangulation G on P has a Grünbaum coloring with each color-induced subgraph connected if and only if every vertex of G has even degree.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 215, 31 December 2016, Pages 155-163
Journal: Discrete Applied Mathematics - Volume 215, 31 December 2016, Pages 155-163
نویسندگان
Michiko Kasai, Naoki Matsumoto, Atsuhiro Nakamoto,