Learn More
A graph is chromatic-choosable if its choice number coincides with its chromatic number. It is shown in this article that, for any graph G, if we join a sufficiently large complete graph to G, thenwe(More)
  • 1