Author:
Jumnongnit Patcharapan,Pimpasalee Wannapol
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference16 articles.
1. Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8;Dvořák;J. Comb. Theory, Ser. B,2018
2. Choosability in graphs;Erdős,1979
3. Planar graphs without cycles of specific lengths;Fijavž;Eur. J. Comb.,2002
4. The 3-choosability of plane graphs of girth 4;Lam;Discrete Math.,2005
5. On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles;Lidický;Australas. J. Comb.,2009
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献