Halin图的Alon-Tarsi数  

The Alon-Tarsi number of Halin graphs

作　　者：李志国[1] 叶晴 邵泽玲[1] LI Zhi-guo;YE Qing;SHAO Ze ling(School of Science,Hebei University of Technology,Tianjin 300401,China)

机构地区：[1]河北工业大学理学院,天津300401

出　　处：《高校应用数学学报（A辑）》2023年第3期373-378,共6页Applied Mathematics A Journal of Chinese Universities(Ser.A)

基　　金：河北省自然基金(A2021202013);河北省高等学校科学技术研究项目(ZD2020130)。

摘　　要：图G的Alon-Tarsi数,是指最小的k使得G存在一个最大出度不大于k-1的定向D满足G的奇支撑欧拉子图的个数不同于偶支撑欧拉子图的个数.通过分析Halin图的结构,利用Alon-Tarsi定向的方法确定了Halin图的Alon-Tarsi数.The Alon-Tarsi number of a graph G is the smallest k for which there is an orientation D of G with max outdegree k-1 such that the number of spanning Eulerian subgraphs of G with an even number of edges differs from the number of spanning Eulerian subgraphs with an odd number of edges.Based on analysis of the structure of Halin graphs,the Alon-Tarsi number of Halin graphs was obtained by using Alon-Tarsi orientation method.

关 键 词：Alon-Tarsi数 列表色数 色数 HALIN图 

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