Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference10 articles.
1. Choosability and fractional chromatic numbers;Alon;Discrete Math.,1997
2. D. Cranston, L. Rabern, Planar graphs are 9/2-colorable, 2015, manuscript.
3. Choosability in graphs;Erdős,1980
4. The complexity of planar graph choosability;Gutner;Discrete Math.,1996
5. M. Han, X. Zhu, Every planar graph is 1-defective (9,2)-paintable, 2016, manuscript.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献