Hits :

First Author : Bu, Yuehua

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2006-01-01

Document Type : 期刊

Journal : Discrete Mathematics

Volume: Vol.306

Issue : NO.13

Page Number : 1440-1445

ISSN : 0012-365X

Translation or Not : no

Key Words : Graph;theory;Computational;complexity;Problem;solving;Computational;methods

Abstract : Let G be a planar graph of maximum degree 6. In this paper we prove that if G does not contain either a 6-cycle, or a 4-cycle with a chord, or a 5- and 6-cycle with a chord, then chi** prime (G) = 6, where chi** prime (G) denotes the chromatic index of G.