典型文献
Acyclic Choosability of Graphs with Bounded Degree
文献摘要：
An acyclic colouring of a graph G is a proper vertex colouring such that every cycle uses at least three colours.For a list assignment L ={L(v)| v ∈ V(G)},if there exists an acyclic colouring ρ such that ρ(v) ∈ L(v) for each v ∈ V(G),then ρ is called an acyclic L-list colouring of G.If there exists an acyclic L-list colouring of G for any L with |L(v)| ≥ k for each v ∈ V(G),then G is called acyclically k-choosable.In this paper,we prove that every graph with maximum degree △ ≤ 7 is acyclically 13-choosable.This upper bound is first proposed.We also make a more compact proof of the result that every graph with maximum degree △ ≤ 3 (resp.,△ ≤ 4) is acyclically 4-choosable(resp.,5-choosable).
文献关键词：
中图分类号：
作者姓名：
Juan WANG;Lian Ying MIAO;Jin Bo LI;Yun Long LIU
作者机构：
School of Management,Qufu Normal University,Rizhao 276826,P.R.China;School of Mathematics,China University of Mining and Technology,Xuzhou 221116,P.R.China;College of Engineering,Qufu Normal University,Rizhao 276826,P.R.China
文献出处：
引用格式：
[1]Juan WANG;Lian Ying MIAO;Jin Bo LI;Yun Long LIU-.Acyclic Choosability of Graphs with Bounded Degree)[J].数学学报（英文版）,2022(03):560-570
A类：
Choosability,colouring,acyclically,choosable
B类：
Acyclic,Graphs,Bounded,Degree,An,graph,proper,vertex,such,that,every,cycle,uses,least,three,colours,For,list,assignment,if,there,exists,each,then,called,If,any,In,this,paper,we,prove,maximum,degree,This,upper,bound,first,proposed,We,also,make,more,compact,proof,result,resp
AB值：
0.427478
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
