Abstract
A graph is k-critical if it is k-chromatic but each of its proper induced subgraphs is (k - 1)-colorable. It is known that the number of 4-critical P-......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
