设图G(V,E)为简单图,其点数不小于3.则其邻强边染色是指对于图G(V,E),若σ:E→{1, 2,...,n}为其一正常着色,u,v∈V,当uv∈E(G)时......

设图G(V,E)为简单图,其点数不小于3.图G(V,E)的k-邻强边染色是指映射f:E(G)→{1,2,…,k},使f为正常边着色,且( ) u,v ∈ V(G),当uv......

For a proper edge coloring c of a graph G,if the sets of colors of adjacent vertices are distinct,the edge coloring c is......

图的邻强边着色算法是一个NP-完全问题.提出了图的邻强边着色问题的混合遗传算法.在设计交叉、变异方式时,将两点交叉与局部扫描结......