Abstract
The entire chromatic number chi(vef)(G) of a plane graph G is the least number of colors such that any two adjacent or incident elements in V(G) boole......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
