Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

SOME RESULTS ON TOTAL COLORINGS OF PLANAR GRAPHS

  • Hou, Jianfeng (School of Mathematics and System Science, Shandong University) ;
  • Liu, Guizhen (School of Mathematics and System Science, Shandong University) ;
  • Xin, Yongxun (LaiYang Agriculture College) ;
  • Lan, Mei (The Department of Finance, Jinan Vocational College)
  • Published : 2008.05.31
Download PDF
⟨ Previous Next ⟩

Abstract

Let G be a planar graph. It is proved that if G does not contain a k-cycle with a chord for some k ${\ni}$ {4,5,6}, then G is total-($\Delta(G)+2$)-colorable.

Keywords