The Chromatic Number of Adjacent-strong Edge Coloring of the Double Graph D(F_m)
Zhang Zhong-fu · Shuxue de shijian yu renshi · 2008
Let G=(V,E)be a normal simple connected graph of order ≥3.A k-normal edge-coloring f for G is called a k-adjacent strong edge-coloring(shortly,k-ASEC)for G if any two adjacent vertices are incident to different sets of colored edges.The minimum of all positive integers k such that there is a k-ASEC for G is said to be the chromatic number of adjacent strong edge coloring of G and denoted by χ'as(G).In this paper,we compute the chromatic number of adjacent strong edge coloring of the double graph D(Fm).