-
摘要: 研究一些完全k-部图的选择数,并纠正了 S. Gravier 和 H. Enomoto 等人的一些错误. 得到了完全k-部图 K$(4, 2, ...,2) 的选择数,并指出了一类选择数不等于染色数的图.Abstract: This paper investigated the choice number of some complete k-partite graphs, pointed out and corrected some mistakes of S. Gravier, H. Enomoto, et al.. The choice number of the complete k-partite graph K(4, 2, ..., 2) were determined, and also presented were a type of complete multi-partite graphs whose choice numbers are not equal to their chromatic numbers.
点击查看大图
计量
- 文章访问数: 2693
- HTML全文浏览量: 12
- PDF下载量: 277
- 被引次数: 0