多重在线列表染色
Multiple Online List Coloring
DOI: 10.12677/AAM.2020.93049, PDF,   
作者: 颜嘉燕：浙江师范大学数学与计算机科学学院，浙江 金华
关键词: 多重在线列表染色；Ohba猜想；Multiple Online List Coloring； Ohba’s Conjecture
摘要: 在2009年Zhu和Schauz分别提出的在线列表染色中，图的列表配置是随着在线染色游戏的进行在线给出的。James Carraher，Sarah Loeb和Thomas Mahoney等人证明了在线版本的Ohba猜想的一部分。我们将这个结果推广到了多重染色中。
Abstract: In online list coloring (introduced by Zhu and by Schauz in 2009), the list configuration of the graph is given online as the online coloring game proceeds. James Carraher, Sarah Loeb and Thomas Mahoney etc. proved a partial result toward the paint analogue of Ohba's Conjecture. We extend this result to multiple online coloring.
文章引用：颜嘉燕. 多重在线列表染色[J]. 应用数学进展, 2020, 9(3): 408-413. https://doi.org/10.12677/AAM.2020.93049

参考文献

[1] Zhu, X. (2009) On-Line List Colouring of Graphs. Electronic Journal of Combinatorics, 16, 3665-3677. [Google Scholar] [CrossRef] 
[2] Ohba, K. (2002) On Chromatic-Choosable Graphs. Journal of Graph Theory, 40, 130-135. [Google Scholar] [CrossRef] 
[3] Noel, J.A.; Reed, B.A. and Wu, H. (2015) A Proof of a Conjecture of Ohba. Journal of Graph Theory, 79, 86-102. [Google Scholar] [CrossRef] 
[4] Kozik, J., Micek, P. and Zhu, X. (2014) Towards an On-Line Version of Ohba’s Conjecture. European Journal of Combinatorics, 36, 110-121. [Google Scholar] [CrossRef] 
[5] Carraher, J., Loeb, S., Mahoney, T., et al. (2014) Three Topics in Online List Coloring. Journal of Combinatorics, 5, 115-130. [Google Scholar] [CrossRef] 
[6] Dvo?ák, Z., Hu, X. and Sereni, J.-S. (2017) A 4-Choosable Graph That Is Not (8:2)-Choosable. Journal of Graph Theory, 1-4.

为你推荐