华东师范大学学报(自然科学版) ›› 2007, Vol. 2007 ›› Issue (1): 56-61.

• 数学 • 上一篇    下一篇

一些完全多部图的选择数(英)

许洋1,2   

  1. 1. 中国矿业大学 理学院, 江苏 徐州 221008; 2. 莱阳农学院 理学院, 山东 青岛 266109
  • 收稿日期:2005-10-18 修回日期:2006-03-17 出版日期:2007-01-25 发布日期:2007-01-25
  • 通讯作者: 许洋

Choice Number of Some Complete Multi-partite Graphs(English)

XU Yang1,2   

  1. 1. College of Sciences, China University of Mining and Technology, Xuzhou Jiangsu 221008, China; 2. School of Sciences, Laiyang Agricultural University, Qingdao Shandong 266109, China
  • Received:2005-10-18 Revised:2006-03-17 Online:2007-01-25 Published:2007-01-25
  • Contact: XU Yang

摘要： 研究一些完全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.

Key words: complete multi-partite graphs, choice number, list coloring, complete multi-partite graphs, choice number