Some Results on Edge Cover Coloring of Double Graphs

• 作者: Jihui Wang Qiaoling Ma
• 来源期刊: 应用数学(英文)
• 学科: 数学
• 关键词: EDGE COVER COLORING Classification DOUBLE GRAPH
• 年，卷（期）: 2012,（3）
• 页码范围: 264-266
• 页数: 3页
• 分类号: O1

摘要

Let G be a simple graph with vertex set V(G) and edge set E(G). An edge coloring C of G is called an edge cover coloring, if each color appears at least once at each vertex . The maximum positive integer k such that G has a k edge cover coloring is called the edge cover chromatic number of G and is denoted by . It is known that for any graph G, . If , then G is called a graph of CI class, otherwise G is called a graph of CII class. It is easy to prove that the problem of deciding whether a given graph is of CI class or CII class is NP-complete. In this paper, we consider the classification on double graph of some graphs and a polynomial time algorithm can be obtained for actually finding such a classification by our proof.