R. P. Gupta, “On Decompositions of a Multigraph into Spanning Subgraphs,” Bulletin of the American Mathematical Society, Vol. 80, No. 3, 1974, pp. 500-502. doi:10.1090/S0002-9904-1974-13468-3

has been cited by the following article:

• TITLE: Some Results on Edge Cover Coloring of Double Graphs

  AUTHORS: Jihui Wang, Qiaoling Ma

  KEYWORDS: Edge Cover Coloring; Classification; Double Graph

  JOURNAL NAME: Applied Mathematics, Vol.3 No.3, March 27, 2012

  ABSTRACT: 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.