计算机工程与应用2019，Vol.55Issue(24)：37-40,4.DOI:10.3778/j.issn.1002-8331.1812-0190
外1-平面图的均匀边染色
Equitable Edge Coloring of Outer-1-Planar Graphs
摘要
Abstract
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 chro-matic 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.关键词
均匀边染色/均匀边色数阈值/外1-平面图Key words
equitable edge coloring/equitable edge chromatic threshold/outer-1-planar graph分类
数理科学引用本文复制引用
李艳,张欣..外1-平面图的均匀边染色[J].计算机工程与应用,2019,55(24):37-40,4.基金项目
西安市科协青年人才托举计划(No.2018-2020) （No.2018-2020）
中央高校基本科研业务费项目(No.JB170706) （No.JB170706）
陕西省自然科学基础研究计划面上基金(No.2017JM1010). （No.2017JM1010）
