A decomposition approach to solve the selective graph coloring problem in some perfect graph families
Sign Up to like & getrecommendations! Published in 2019 at "Networks"
DOI: 10.1002/net.21850
Abstract: Graph coloring is the problem of assigning a minimum number of colors to all vertices of a graph such that no two adjacent vertices receive the same color. The selective graph coloring problem is a… read more here.
Keywords: graph; perfect graph; coloring problem; problem ... See more keywords