Subject
Discrete Mathematics and Combinatorics
Reference14 articles.
1. Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency;Cowen;J. Graph Theory,1986
2. Planar graphs are 1-relaxed, 4-choosable;Cushing;European J. Combin.,2010
3. Locally planar graphs are 5-choosable;DeVos;J. Combin. Theory Ser. B,2008
4. Defective list colorings of planar graphs;Eaton;Bull. Inst. Combin. Appl.,1999
5. Locally planar graphs are 5-paintable;Han;Discrete Math.,2015
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Every planar graph is 1-defective (9,2)-paintable;Discrete Applied Mathematics;2021-05
2. The Alon-Tarsi number of a planar graph minus a matching;Journal of Combinatorial Theory, Series B;2020-11
3. Multiple list colouring of planar graphs;Journal of Combinatorial Theory, Series B;2017-01