Let us mention some of them: Problem 1: Is it true that a graph with list chromatic number k is circularly k-choosable? Problem 2: If G is a graph with maximum vertex degree D, is the line graph of G ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results