کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4648271 1342403 2010 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Coloring vertices and faces of maps on surfaces
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Coloring vertices and faces of maps on surfaces
چکیده انگلیسی

The vertex-face chromatic number of a map on a surface is the minimum integer mm such that the vertices and faces of the map can be colored by mm colors in such a way that adjacent or incident elements receive distinct colors. The vertex-face chromatic number of a surface is the maximal vertex-chromatic number for all maps on the surface. We give an upper bound on the vertex-face chromatic number of the surfaces of Euler genus ≥2≥2. The upper bound is less (by 1) than Ringel’s upper bound on the 1-chromatic number of a surface for about 5/125/12 of all surfaces. We show that there are good grounds to suppose that the upper bound on the vertex-face chromatic number is tight.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 310, Issue 19, 6 October 2010, Pages 2504–2509
نویسندگان
,