Journal of applied mathematics & informatics
- 제22권1_2호
- /
- Pages.435-440
- /
- 2006
- /
- 2734-1194(pISSN)
- /
- 2234-8417(eISSN)
EDGE COVERING COLORING OF NEARLY BIPARTITE GRAPHS
- Wang Ji-Hui (School of Science, Jinan University) ;
- Zhang Xia (School of Mathematics and System Science, Shandong University) ;
- Liu Guizhen (School of Mathematics and System Science, Shandong University)
- 발행 : 2006.09.01
초록
Let G be a simple graph with vertex set V(G) and edge set E(G). A subset S of E(G) is called an edge cover of G if the subgraph induced by S is a spanning subgraph of G. The maximum number of edge covers which form a partition of E(G) is called edge covering chromatic number of G, denoted by X'c(G). It is known that for any graph G with minimum degree
키워드