数学物理学报(英文版)

• 论文 • 上一篇    下一篇

CIRCULAR CHROMATIC NUMBER AND MYCIELSKI GRAPHS

刘红美   

  1. 三峡大学理学院, 宜昌 443002
  • 收稿日期:2005-05-25 修回日期:1900-01-01 出版日期:2006-04-20 发布日期:2006-04-20
  • 通讯作者: 刘红美
  • 基金资助:

    Supported by National Science Foundation of China (10371048)and the Science Foundation of Three Gorges University.

CIRCULAR CHROMATIC NUMBER AND MYCIELSKI GRAPHS

Liu Hongmei   

  1. College of Science, Three Gorges University, Yichang 443002, China
  • Received:2005-05-25 Revised:1900-01-01 Online:2006-04-20 Published:2006-04-20
  • Contact: Liu Hongmei

PDF (PC)

1569

摘要：

For a general graph G, M(G) denotes its Mycielski graph. This article gives a number of new sufficient conditions for G to have the circular chromatic
number χc(M(G)) equals to the chromatic number χ(M(G)),
which have improved some best sufficient conditions published up to date.

关键词: Circular chromatic number, Mycielski graphs, chromatic number

Abstract:

For a general graph G, M(G) denotes its Mycielski graph. This article gives a number of new sufficient conditions for G to have the circular chromatic
number χc(M(G)) equals to the chromatic number χ(M(G)),
which have improved some best sufficient conditions published up to date.

Key words: Circular chromatic number, Mycielski graphs, chromatic number

中图分类号: 

  • 05C15
版权所有 © 《数学物理学报(英文版)》杂志社
地址：武汉市71010号信箱(430071)　电话: 027-87199206(中文版)　027-87199087(英文版)
E-mail: actams@apm.ac.cn
本系统由北京玛格泰克科技发展有限公司设计开发