GRAPHS WHOSE CIRCULAR CLIQUE NUMBER EQUAL THE CLIQUE NUMBER

2005系统科学与复杂性：英文版Mathematics被引 1

摘要

The circular clique number of a graph G is the maximum fractional k/d such that G^kd admits a homomorphism to G. In this paper, we give some sufficient conditions for graphs whose circular clique number equal the clique number, we also characterize the K1,3-free graphs and planar graphs with the desired property.

引用本文（GB/T 7714）

XUBaogang, ZHOUXinghe. GRAPHS WHOSE CIRCULAR CLIQUE NUMBER EQUAL THE CLIQUE NUMBER[J]. 系统科学与复杂性：英文版, 2005.

引文网络

参考文献与被引分析加载中…

本站仅收录题录与摘要供学习参考，全文版权归属出版方；如有侵权请联系我们删除。