摘要
利用数学归纳法,通过构造染色,研究系列平行图和Meredith图的无循环边着色.证明了最大度Δ(G)≥5的系列平行图G的无循环边色数a′(G)≤Δ(G)+1;同时证明了对于Meredith图G_k,有a′(G_k)=Δ(G_k).
The acyclic edge colorings of series-parallel graphs and Meredith graphs are studied by using mathematical induction and constructing colorings. It is proved that if the maximum degree Δ（G）≥5,the acyclic edge chromatic index a′（G）≤Δ（G）＋ 1 for series-parallel graph G. And it is proved that a′（Gk）= Δ（Gk） for Meredith graph Gk.
作者
张卫标
谢德政
ZHANG Weibiao;XIE Dezheng(College of Computer Science and Technology, Shangqiu University, Shangqiu 476000, Henan Province, China;College of Mathematics and Statistics, Chongqing University, Chongqing 400044, China)
出处
《天津师范大学学报（自然科学版）》
CAS
北大核心
2018年第2期7-9,共3页
Journal of Tianjin Normal University：Natural Science Edition
基金
国家自然科学基金资助项目(11601128)
河南省高等学校重点科研资助项目(18B110018)
