摘要
如果图G已有一个合理边着色,使得图G中所有相邻顶点间的关联边着色集合相互不同,则这种边着色称为图G的准强边着色。具有准强边着色的图称为准强边着色图,并对准强边着色图给出一个分类。
If a graph G has a proper edge colourings so that the colouring sets of incident edge at all adjacent vertices in the graph G are different from each other, then such an edge colourings is said to be a quasi-strong edge colourings of graph G. The graph with a quasi-strong edge colourings is called the quasi-strong edge colouring graph. This paper gives a classification for the quasi-strong edge colouring graphs.
出处
《金陵科技学院学报》
2006年第4期1-6,11,共7页
Journal of Jinling Institute of Technology
关键词
准强边着色
准强边色数
准强边着色图
分类
quasi-strong edge colourings
quasi-strong edge chromatic number
quasi-strong edge colouring graph
classification