Articles

CIRCULAR CHROMATIC NUMBER AND MYCIELSKI GRAPHS

  • Liu Hongmei
Expand
  • College of Science, Three Gorges University, Yichang 443002, China

Received date: 2005-05-25

  Revised date: 1900-01-01

  Online published: 2006-04-20

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 $\chi_c(M(G))$ equals to the chromatic number $\chi(M(G))$,
which have improved some best sufficient conditions published up to date.

Cite this article

Liu Hongmei . CIRCULAR CHROMATIC NUMBER AND MYCIELSKI GRAPHS[J]. Acta mathematica scientia, Series B, 2006 , 26(2) : 314 -320 . DOI: 10.1016/S0252-9602(06)60053-2

Outlines

/