Journal of applied mathematics & informatics
- 제19권1_2호
- /
- Pages.127-133
- /
- 2005
- /
- 2734-1194(pISSN)
- /
- 2234-8417(eISSN)
THE CLASSIFICATION OF COMPLETE GRAPHS $K_n$ ON f-COLORING
- ZHANG XIA (School of Mathematics and System Science, Shandong University) ;
- LIU GUIZHEN (School of Mathematics and System Science, Shandong University)
- 발행 : 2005.09.01
초록
An f-coloring of a graph G = (V, E) is a coloring of edge set E such that each color appears at each vertex v