Planar graph;
List colouring;
On-line list colouring;
Alon-Tarsi number;
D O I:
10.1016/j.jctb.2018.06.004
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
This paper proves that the Alon-Tarsi number of any planar graph is at most 5, which solves an open problem posed in Hefetz (2011) [2] and gives an alternate proof of the 5-choosability as well as the 5-paintability of planar graphs. (C) 2018 Elsevier Inc. All rights reserved.
机构:
Charles Univ Prague, Fac Math & Phys, Dept Appl Math, CR-11800 Prague, Czech Republic
Charles Univ Prague, Fac Math & Phys, Inst Theoret Comp Sci, CR-11800 Prague, Czech RepublicCharles Univ Prague, Fac Math & Phys, Dept Appl Math, CR-11800 Prague, Czech Republic
Kral', Daniel
Schauz, Uwe
论文数: 0引用数: 0
h-index: 0
机构:
King Fahd Univ Petr & Minerals, Dept Math & Stat, Dhahran 31261, Saudi ArabiaCharles Univ Prague, Fac Math & Phys, Dept Appl Math, CR-11800 Prague, Czech Republic