彩虹不连通染色数  

Rainbow Disconnection Coloring Number

作　　者：李亚平 

机构地区：[1]喀什大学数学与统计学院,新疆 喀什

出　　处：《应用数学进展》2024年第11期4918-4922,共5页Advances in Applied Mathematics

摘　　要：设G是一个非平凡的边染色连通图,如果图G的一个边割R中没有任何两条边是相同的颜色,则称R是图G的一个彩虹边割。u和v是图G的任意两个不相同的顶点,如果图G的一个彩虹边割R满足u和v属于G−R的不同连通分支,则称图G的这个边染色为彩虹不连通染色。本文主要对图的彩虹不连通染色已有的结论进行综述,并讨论了一些结论之间的关系。Let G be a nontrivial connected, edge-colored graph, and an edge-cut R of G is called a rainbow cut if no two edges in R are colored the same. An edge-coloring of G is a rainbow disconnection coloring if for every two distinct vertices u and v of G, there exists a rainbow cut in G, where u and v belong to different components of G−R. In this paper, we summerize the results for rainbow disconnection colorings in graph, and the relationship between some conclusions is discussed.

关 键 词：染色 彩虹染色 连通性 

分 类 号：O15[理学—数学]