摘要
图G的s-均匀边k-染色是指用k种颜色对图的边进行染色,使得图G的每个顶点所关联的任何两种颜色的边的条数至多相差s。使得对于每个不小于k的整数t,图G都具有s-均匀边t-染色的最小整数k称为图G的s-均匀边色数阈值。文中证明了外1-平面图的1-均匀边色数阈值最多为5,不含有相邻的3圈的外1-平面图的均匀边色数阈值最多为4,外1-平面图的2-均匀边色数阈值恰好为1。
An s-equitable edge-k-coloringof a graph G is an edge coloring of G using k colors so that the sizes of any two color classes incident with any fixed vertex of G differ by at most s.The s-equitable edge chromatic threshold of G is the smallest k such that G has an s-equitable edge-t-colorings for integer t that is no less than k.It is proved that the 1-equitable edge chromatic threshold of any outer-1-planar graph is at most 5,the 1-equitable edge chromatic threshold of any outer-1-planar graph without adjacent triangles is at most 4,and the 2-equitable edge chromatic threshold of any outer-1-planar graph is exactly 1.
作者
李艳
张欣
LI Yan;ZHANG Xin(School of Mathematics and Statistics,Xidian University,Xi’an 710071,China)
出处
《计算机工程与应用》
CSCD
北大核心
2019年第24期37-40,共4页
Computer Engineering and Applications
基金
西安市科协青年人才托举计划（No.2018-2020）
中央高校基本科研业务费项目（No.JB170706）
陕西省自然科学基础研究计划面上基金（No.2017JM1010）
关键词
均匀边染色
均匀边色数阈值
外1-平面图
equitable edge coloring
equitable edge chromatic threshold
outer-1-planar graph
