J4

• 数学 • 上一篇    下一篇

一类正则图的邻强边染色

王萃琦1, 苗正科2   

  1. 1. 中国矿业大学 理学院, 江苏 徐州 221008; 2. 徐州师范大学 数学系, 江苏 徐州 221008
  • 收稿日期:2007-06-12 修回日期:1900-01-01 出版日期:2008-05-26 发布日期:2008-05-26
  • 通讯作者: 王萃琦

On Adjacent Strong Edge Coloring of Some Regular Graphs

WANG Cuiqi1, MIAO Zhengke2   

  1. 1. College of Sciences, China University of Mining & Technology, Xuzhou 221008, Jiangsu Province, China;2. Department of Mathematics, Xuzhou Normal University, Xuzhou 221008, Jiangsu Province, China
  • Received:2007-06-12 Revised:1900-01-01 Online:2008-05-26 Published:2008-05-26
  • Contact: WANG Cuiqi

摘要: 研究一类正则图G(n,n,r)(n=1,2(mod 3))的邻强边染色. 用构造性方法给出了一类正则图的邻强边染色, 验证了对|V(G)|≥3的连通图G(V,E)(G(V,E)≠C5), 有Δ(G)≤χ′αs(G)≤Δ(G)+2成立.

关键词: 正则二部图, 邻强边染色, 邻强边色数

Abstract: We studied ASEC of a class of graphs G(n,n,r)(n=1,2(mod 3)), then proved the conjecture that any graph G(V,E)(G(V,E)≠C5)with |V(G)|≥3 satisfies Δ(G)≤χ′αs(G)≤Δ(G)+2 is correct.

Key words: regular partite graph, adjacent strong edge coloring, adjacent strong edge chromatic number

中图分类号: 

  • O157.5