Every Graph Embedded on the Surface with Euler Characteristic Numberε=-1 is Acyclically 11-choosable  

作　　者：Lin SUN Guang Long YU Xin LI 

机构地区：[1]School of Mathematics and Statistics,Lingnan Normal University,Zhanjiang 524000,P.R.China

出　　处：《Acta Mathematica Sinica,English Series》2023年第11期2247-2258,共12页数学学报（英文版）

基　　金：NSFC(Grant Nos.12101285,12171222);Basic and Applied Basic Research Foundation and Jointof Guangdong Province,China(Grant No.2019A1515110324);Guangdong Basic and Applied Basic Research Foundation(Natural Science Foundation of Guangdong Province,China,Grant No.2021A1515010254);Foundation of Lingnan Normal University(Grant Nos.ZL2021017,ZL1923)。

摘　　要：A proper vertex coloring of a graph G is acyclic if there is no bicolored cycles in G.A graph G is acyclically k-choosable if for any list assignment L={L(v):v∈V(G)}with|L(v)|≥k for each vertex v∈V(G),there exists an acyclic proper vertex coloringφof G such thatφ(v)∈L(v)for each vertex v∈V(G).In this paper,we prove that every graph G embedded on the surface with Euler characteristic numberε=-1 is acyclically 11-choosable.

关 键 词：Acyclic coloring CHOOSABILITY graphs embedded on the surface Euler characteristic number 

分 类 号：O157.5[理学—数学]