Three-Rainbow Coloring of Split Graphs  

作　　者：胡玉梅 刘婷婷 

机构地区：[1]School of Sciences Tianjin University

出　　处：《Transactions of Tianjin University》2015年第3期284-287,共4页天津大学学报（英文版）

基　　金：Supported by the National Natural Science Foundation of China(No.11001196)

摘　　要：After a necessary condition is given, 3-rainbow coloring of split graphs with time complexity O(m) is obtained by constructive method. The number of corresponding colors is at most 2 or 3 more than the minimum number of colors needed in a 3-rainbow coloring.After a necessary condition is given, 3-rainbow coloring of split graphs with time complexity O（m） is obtained by constructive method. The number of corresponding colors is at most 2 or 3 more than the minimum num- ber of colors needed in a 3-rainbow coloring.

关 键 词：edge coloring 3-rainbow coloring ALGORITHM split graph 

分 类 号：O157.5[理学—数学]