摘要
The circular clique number of a graph G is the maximum fractional k/d suchthat G_d^k admits a homomorphism to G. In this paper, we give some sufficient conditions for graphswhose circular clique number equal the clique number, we also characterize the K_(1,3)-free graphsand planar graphs with the desired property.
基金
This research is supported partially by the National Natural Science Foundation of China(10371055).
