摘要
为了研究Meredith图和系列平行图的无循环边着色问题,本文利用矩阵分析法、数学归纳法及其换色技巧,证明了若G_k是一个Meredith图,则有a'(G_k)=Δ(G_k),同时也证明了Δ(G)≥5的系列平行图的无循环边色数a'(G)≤Δ(G)+1。
In order to study acyclic edge coloring of Meredith graphs and series-parallel graphs,matrix analysis,mathematical induction as well as color-changing technique were employed in the study. The results show that for Meredith graphs,the equation a＇（G） = Δ（Gk） is proved. Meanwhile,for series-parallel graphs of Δ（Gk） ≥5,a＇（G） ≤ Δ（G） ＋ 1 is also proved.
作者
张卫标
杨瑞
ZHANG Weibiao1 ,YANG Rui2(1. College of Computer Science And Technology , ShangQiu University, Shangqiu 476000, Henan, China ;2. School of Mathematics and Information Science, Henan Polytechnic University, Jiaozuo 454000, Henan , China)
出处
《河南理工大学学报（自然科学版）》
CAS
北大核心
2018年第4期153-156,共4页
Journal of Henan Polytechnic University（Natural Science）
基金
国家自然科学基金资助项目(11626089)
