An edge-colored graph G is conflict-free connected if any two of its vertices are connected by a path,which contains a c......

根据星、扇、轮的联图的特点，结合邻边的关系，利用循环染色法，得到了星、扇、轮的联图的点可区别均匀边色数。......