For a simple finite graph G let C-o(G) and C-e(G) denote the set of odd cycle lengths and even cycle lengths in a graph G, respectively. We will show that the chromatic number chi(G) of G satisfies: chi(G) less than or equal to min {2r + 2,2s + 3} less than or equal to r + s + 2, if \Co(G)\ = r and \Ce(G)\ = s. (C) 2004 Elsevier B.V. All rights reserved.
机构:
Univ Teknol MARA, Fac Comp & Math Sci, Segamat Campus, Johor Baharu 85000, MalaysiaUniv Teknol MARA, Fac Comp & Math Sci, Segamat Campus, Johor Baharu 85000, Malaysia
Lau, Gee-Choon
Shiu, Wai-Chee
论文数: 0引用数: 0
h-index: 0
机构:
Hong Kong Baptist Univ, Dept Math, Kowloon Tong, 224 Waterloo Rd, Hong Kong, Peoples R ChinaUniv Teknol MARA, Fac Comp & Math Sci, Segamat Campus, Johor Baharu 85000, Malaysia
Shiu, Wai-Chee
Ng, Ho-Kuen
论文数: 0引用数: 0
h-index: 0
机构:
San Jose State Univ, Dept Math, San Jose, CA 95192 USAUniv Teknol MARA, Fac Comp & Math Sci, Segamat Campus, Johor Baharu 85000, Malaysia