کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4653385 | 1632776 | 2015 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Unique Fulkerson coloring of Petersen minor-free cubic graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Let G be a cubic graph and the graph 2G is obtained by replacing each edge of G with a pair of parallel edges. A proper 6-edge-coloring of 2G is called a Fulkerson coloring of G. It was conjectured by Fulkerson that every bridgeless cubic graph has a Fulkerson coloring. In this paper we show that for a Petersen-minor free Graph G, G is uniquely Fulkerson colorable if and only if G constructed from K4 via a series of YâÎ-operations (expending a vertex by a triangle). This theorem is a partial result to the conjecture that, for a Petersen-minor free Graph G, G is uniquely 3-edge-colorable if and only if G constructed from K4 via a series of YâÎ-operations (expending a vertex by a triangle).
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Combinatorics - Volume 43, January 2015, Pages 165-171
Journal: European Journal of Combinatorics - Volume 43, January 2015, Pages 165-171
نویسندگان
Zhengke Miao, Xiaofeng Wang, Cun-Quan Zhang,