计算机工程与应用2018，Vol.54Issue(10)：51-53,80,4.DOI:10.3778/j.issn.1002-8331.1703-0356
外1-平面图的均匀点荫度
Equitable vertex arboricity of outer-1-planar graphs
摘要
Abstract
An equitable tree-k-coloring is a vertex k-coloring.The sizes of any two color classes differ by at most 1,and the subgraph induced by any color class is a forest.The minimum integer k that a graph G admits an equitable tree-k-coloring is the equitable vertex arboricity of G.It is proven that the equitable vertex arboricity of every outer-1-planar graph is at most 3,and then the equitable vertex arboricity conjecture is verified for outer-1-planar graphs.关键词
图论/外1-平面图/均匀染色/点荫度Key words
graph theory/outer-1-planar graph/equitable coloring/vertex arboricity分类
数理科学引用本文复制引用
刘维婵,张欣..外1-平面图的均匀点荫度[J].计算机工程与应用,2018,54(10):51-53,80,4.基金项目
高等学校博士学科点专项科研基金新教师类项目(No.20130203120021) （No.20130203120021）
国家自然科学基金青年科学基金项目(No.11301410) （No.11301410）
陕西省自然科学基础研究计划面上基金项目(No.2017JM1010) （No.2017JM1010）
中央高校基本科研业务费项目(No.JB170706). （No.JB170706）
