Adjacent Vertex Reducible Edge Coloring for graphs
Zhe Ding, Jingwen Li, Rong Luo, Lijing Zhang · 2022 IEEE 10th Joint International Information Technology and Artificial Intelligence Conference (ITAIC) · 2022
Mapping the edges of a simple graph G(V, E) to a set of positive integers{1,2,…, k},and the color sets of any adjacent points of the same degree in the graph are the same, which is called Adjacent Vertex Reducible Edge Coloring. Based on the existing graph coloring algorithm, this paper designs a new type of AVREC algorithm. The algorithm uses iterative optimization to solve all non isomorphic graph sets in finite points. Through the analysis of experimental results, the coloring properties of several kinds of joint graphs are found, and some theorems are summarized and proved.