外平面图的邻点可区分边染色.pdfVIP

NEIGHBOUR-DISTINGUISHING EDGE CHROMATIC NUMBER ON OURTER PLANE GRAPH ABSTRACT Let G(V,E ) be a graph, for an edge-colouring ϕ of graph G, the colour set of a vertex x ∈ V(G) is the set of colours of edges incident to x , and will be de- noted by S ϕ(x). If S ϕ(x) S ϕ(y ) for every two adjacent vertices x ,y , we call this edge colouring ϕneighbour-distinguishing edge colouring . In short, it’s calledndedge-colouri