Author:
Chen Min,Fan Yingying,Wang Yiqiao,Wang Weifan
Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference10 articles.
1. Choi I, Lidický B, Stolee D (2016) On choosability with separation of planar graphs with forbidden cycles. J Gr Theory 81:283–306
2. Chen M, Lih, Wang W (2016) On choosability with separation of planar graphs without adjacent short cycles. Bull Malays Math Sci Soc. doi:
10.1007/s40840-016-0409-0
3. Füredi Z, Kostochka A, Kumbhat M (2014) Choosability with separation of complete multipartite graphs and hypergraphs. J Gr Theory 76:129–137
4. Füredi Z, Kostochka A, Kumbhat M (2013) Choosability with separation of complete graphs and minimal abundant packings. Combinatorics.
arXiv:1303.4030
5. Kratochvíl J, Tuza Z, Voigt M (1998) Brooks-type theorems for choosability with separation. J Gr Theory 27:43–49
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献