Hits :

First Author : Weifan Wang

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2016-01-01

Document Type : 期刊

Journal : Journal of Global Optimization

Volume: Vol.65

Issue : No.2

Page Number : 351-367

ISSN : 0925-5001;1573-2916

Translation or Not : no

Key Words : Breadth;first;search;Tree;Outerplanar;graph;Edge;coloring;2-Distance;vertex-distinguishing;index

Abstract : Given a graph G, we study the problem of finding the minimum number of colors required for a proper edge coloring of G such that any pair of vertices at distance 2 have distinct sets consisting of colors of their incident edges. This minimum number is cal